An Approach of MST Generation Algorithm Based on Node Weightage

Provided by: International Journal of Advanced Networking and Applications (IJANA)
Topic: Networking
Format: PDF
In this paper, the authors consider generation of Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. They propose a new algorithm to find out minimal spanning tree of the graph G based on the weight age 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.

Find By Topic