文章基本信息

标题：A New Efficient Technique to Construct a Minimum Spanning Tree
本地全文：下载
作者：Ardhendu Mandal ; Jayanta Dutta ; S.C. Pal 等
期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：10
出版社：S.S. Mishra
摘要：A minimum spanning tree of a weighted graph is a tree of the graph which contains all the vertices of the graph and the sum of weights of all its edges are minimum among all such possible trees of the graph. In this paper, we have proposed a new technique and its corresponding algorithm to construct the minimum spanning tree of a weighted graph. This new alg orithm is based on the weight matrix of a weighted graph.
关键词：Graph; Weighted Graph; Tree; Minimum Spanning Tree; Complexity; Sparse Matrix