Minimum Spanning Tree Method for Sparse Graphs

被引：1

作者：

Wang, Xianchao ^{[1
]}

Li, Shaoyi ^{[1
]}

Hou, Changhui ^{[1
]}

Zhang, Guoming ^{[2
]}

机构：

[1] School of Information and Artificial Intelligence, Nanchang Institute of Science and Technology, Nanchang,330108, China

[2] Nanchang Industry and Technology School, Nanchang,330108, China

来源：

Mathematical Problems in Engineering | 2023年 / 2023卷

关键词：

Connected graph - Experiment and analysis - Higher efficiency - Kruskal's algorithms - Minimums panning tree - Spanning-tree methods - Sparse graphs;

D O I：

10.1155/2023/8591115

中图分类号：

学科分类号：

摘要：

The minimum spanning tree (MST) is widely used in planning the most economical network. The algorithm for finding the MST of a connected graph is essential. In this paper, a new algorithm for finding MST is proposed based on a deduced theorem of MST. The algorithm first sorts the edges in the graph according to their weight, from large to small. Next, on the premise of ensuring the connectivity of the graph, it deletes the edges in this order until the number of edges of the graph is equal to the number of vertexes minus 1. Finally, the remaining graph is an MST. This algorithm is equivalent to an inverse Kruskal algorithm. For sparse graphs, the proposed algorithm has higher efficiency than the Kruskal algorithm. Experiments and analysis verify the effectiveness of the algorithm proposed in this paper. The algorithm provides a better choice for finding the MST of the sparse graph. © 2023 Xianchao Wang et al.

引用

共 50 条

[21] An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
Nakayama, Shin-Ichi
Masuyama, Shigeru
[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2003, E86-A (05) : 1019 - 1026
[22] The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Jean Cardinal
Erik D. Demaine
Samuel Fiorini
Gwenaël Joret
Ilan Newman
Oren Weimann
[J]. Journal of Combinatorial Optimization, 2013, 25 : 19 - 46
[23] Pruning a minimum spanning tree
Sandoval, Leonidas, Jr.
[J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (08) : 2678 - 2711
[24] The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Cardinal, Jean
Demaine, Erik D.
Fiorini, Samuel
Joret, Gwenael
Newman, Ilan
Weimann, Oren
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (01) : 19 - 46
[25] Solving the Minimum Spanning Tree Problem in Stochastic Graphs Using Learning Automata
Torkestani, J. Akbari
Meybodi, M. R.
[J]. 2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT AND ENGINEERING, PROCEEDINGS, 2009, : 643 - +
[26] Minimum spanning tree with neighborhoods
Yang, Yang
Lin, Mingen
Xu, Jinhui
Xie, Yulai
[J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 306 - +
[27] Vertex-driven parallel minimum spanning tree algorithms on large graphs
[J]. 1600, Science Press (51):
[28] FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
HSU, LH
JAN, RH
LEE, YC
HUNG, CN
CHERN, MS
[J]. INFORMATION PROCESSING LETTERS, 1991, 39 (05) : 277 - 281
[29] NORMALIZATION OF THE MINIMUM SPANNING TREE
MARCELPOIL, R
[J]. ANALYTICAL CELLULAR PATHOLOGY, 1993, 5 (03): : 177 - 186
[30] Enhancement of Minimum Spanning Tree
Patel, Nimesh
Patel, K. M.
[J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ICT FOR SUSTAINABLE DEVELOPMENT, ICT4SD 2015, VOL 1, 2016, 408 : 89 - 95

← 1 2 3 4 5 →