An Approach of MST Generation Algorithm Based on Node Weightage
Journal: International Journal of Advanced Networking and Applications (Vol.1, No. 03)Publication Date: 2009-11-02
Authors : Sanjay Kumar Pal; Samar Sen Sarma;
Page : 154-158
Keywords : Graph; Subgraph; Tree; Spanning Tree; Minimal Spanning Tree; Weightage;
Abstract
This paper considers generation of Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this
paper, we propose a new algorithm to find out minimal spanning tree of the graph G based on the weightage of nodes in graph. The time complexity of the problem is in polynomial order with better execution time comparing to the existing algorithms. The goal is to design an algorithm that is simple, elegant, easy to understand and applicable in field of networking design, optimization of network cost, and mobile computing.
Other Latest Articles
- Reliability in MANET’s Using Enhanced Double Coverage Broadcasting (EDCB)
- A New Method for Load Balancing and QOS in On demand Protocols?In the MANET’s Perspective
- Enhancing security of Pass Points system using variable tolerance
- IPv6 and IPv4 Security challenge Analysis and Best- Practice Scenario
- Packet Transmission Analysis in Vehicular Ad Hoc Networks using Revival Mobility Model
Last modified: 2015-12-05 20:55:31