A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs

被引：0
|
作者：
T. Matsui
机构：
[1] Department of Mathematical Engineering and Information Physics,
[2] Faculty of Engineering,undefined
[3] University of Tokyo,undefined
[4] Bunkyo-ku,undefined
[5] Tokyo 113,undefined
[6] Japan. tomomi@misojiro.t.u-tokyo.ac.jp.,undefined
来源：
Algorithmica | 1997年 / 18卷
关键词：
Key words. Enumeration problem, Spanning tree.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we propose an algorithm for generating all the spanning trees in undirected graphs. The algorithm requires O (n+m+ τ n) time where the given graph has n vertices, m edges, and τ spanning trees. For outputting all the spanning trees explicitly, this time complexity is optimal.
引用
收藏
页码：530 / 543
页数：13
相关论文
共 50 条
  • [1] A flexible algorithm for generating all the spanning trees in undirected graphs
    Matsui, T
    [J]. ALGORITHMICA, 1997, 18 (04) : 530 - 543
  • [2] An optimal algorithm for scanning all spanning trees of undirected graphs
    Shioura, A
    Tamura, A
    Uno, T
    [J]. SIAM JOURNAL ON COMPUTING, 1997, 26 (03) : 678 - 692
  • [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] A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
    Ma Jun
    Ma Shaohan
    Kazuo Iwama
    Gu Qianping
    [J]. Acta Mathematicae Applicatae Sinica, 1999, 15 (3) : 303 - 309
  • [5] 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
  • [6] A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
    Arindam Dey
    Said Broumi
    Le Hoang Son
    Assia Bakali
    Mohamed Talea
    Florentin Smarandache
    [J]. Granular Computing, 2019, 4 : 63 - 69
  • [7] A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
    Dey, Arindam
    Broumi, Said
    Le Hoang Son
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    [J]. GRANULAR COMPUTING, 2019, 4 (01) : 63 - 69
  • [8] 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
  • [9] Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review
    Chakraborty, Maumita
    Chowdhury, Sumon
    Chakraborty, Joymallya
    Mehera, Ranjan
    Pal, Rajat Kumar
    [J]. COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (03) : 265 - 281
  • [10] 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
12345