文章基本信息

标题：An Approach of MST Generation Algorithm Based on Node Weightage
本地全文：下载
作者：Sanjay Kumar Pal ; Samar Sen Sarma
期刊名称：International Journal of Advanced Networking and Applications
电子版ISSN：0975-0290
出版年度：2009
卷号：1
期号：3
页码：154-158
出版社：Eswar Publications
摘要：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
关键词：Graph; Subgraph; Tree; Spanning Tree; Minimal Spanning Tree; Weightage