![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
An Approach of MST Generation Algorithm Based on Node Weightage
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.
Keywords
Graph, Subgraph, Tree, Spanning Tree, Minimal Spanning Tree, Weightage.
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 187
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0