Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review

被引：17

作者：

Chakraborty, Maumita ^{[1
]}

Chowdhury, Sumon ^{[2
]}

Chakraborty, Joymallya ^{[2
]}

Mehera, Ranjan ^{[3
]}

Pal, Rajat Kumar ^{[2
]}

机构：

[1] Inst Engn & Management, Dept Informat Technol, Y-12,Block EP,Sect 5, Kolkata 700091, India

[2] Univ Calcutta, Dept Comp Sci & Engn, JD-2,Sect 3, Kolkata 700098, India

[3] Subex Inc, 12303 Airport Way,Suite 390, Broomfield, CO 80021 USA

来源：

COMPLEX & INTELLIGENT SYSTEMS | 2019年 / 5卷 / 03期

关键词：

Algorithms; Complexity; Graph Theory; Spanning Trees; ENUMERATION; COMPLEXITY;

D O I：

10.1007/s40747-018-0079-7

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Generation of all possible spanning trees of a graph is a major area of research in graph theory as the number of spanning trees of a graph increases exponentially with graph size. Several algorithms of varying efficiency have been developed since early 1960s by researchers around the globe. This article is an exhaustive literature survey on these algorithms, assuming the input to be a simple undirected connected graph of finite order, and contains detailed analysis and comparisons in both theoretical and experimental behavior of these algorithms.

引用

页码：265 / 281

页数：17

共 42 条

[1] Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review
Maumita Chakraborty
Sumon Chowdhury
Joymallya Chakraborty
Ranjan Mehera
Rajat Kumar Pal
[J]. Complex & Intelligent Systems, 2019, 5 : 265 - 281
[2] Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
Chakraborty, Maumita
Chowdhury, Sumon
Pal, Rajat K.
[J]. IEEE ACCESS, 2018, 6 : 56290 - 56300
[3] ALGORITHMS FOR GENERATING ALL SPANNING-TREES OF UNDIRECTED, DIRECTED AND WEIGHTED GRAPHS
KAPOOR, S
RAMESH, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 461 - 472
[4] Listing all the minimum spanning trees in an undirected graph
Yamada, Takeo
Kataoka, Seiji
Watanabe, Kohtaro
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (14) : 3175 - 3185
[5] Properties on the average number of spanning trees in connected spanning subgraphs for an undirected graph
Cheng, P
Masuyama, S
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (05) : 1027 - 1033
[6] A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
T. Matsui
[J]. Algorithmica, 1997, 18 : 530 - 543
[7] A flexible algorithm for generating all the spanning trees in undirected graphs
Matsui, T
[J]. ALGORITHMICA, 1997, 18 (04) : 530 - 543
[8] Undirected simple connected graphs with minimum number of spanning trees
Bogdanowicz, Zbigniew R.
[J]. DISCRETE MATHEMATICS, 2009, 309 (10) : 3074 - 3082
[9] EFFICIENTLY SCANNING ALL SPANNING-TREES OF AN UNDIRECTED GRAPH
SHIOURA, A
TAMURA, A
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1995, 38 (03) : 331 - 344
[10] ALGORITHMS FOR ENUMERATING ALL SPANNING-TREES OF UNDIRECTED AND WEIGHTED GRAPHS
KAPOOR, S
RAMESH, H
[J]. SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 247 - 265

← 1 2 3 4 5 →