An algorithm for enumerating all spanning trees of a directed graph

被引：22
|
作者：
Kapoor, S [1 ]
Ramesh, H
机构：
[1] Indian Inst Technol, New Delhi 10016, India
[2] Indian Inst Sci, Dept Comp Sci, Bangalore 560012, Karnataka, India
来源：
ALGORITHMICA | 2000年 / 27卷 / 02期
关键词：
spanning tree; directed graph; enumeration;
D O I：
10.1007/s004530010008
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present an O(NV + V-3) ti, algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V-2 = o(N), which will be true for most graphs. Here, N refers to the number of spanning trees of a graph having V vertices and E edges, The algorithm is based on the technique of obtaining one spanning tree from another by a series of edge swaps. This result complements the result in the companion paper [3] which enumerates all spanning trees in an undirected graph in O(N + V + E) time.
引用
收藏
页码：120 / 130
页数：11
相关论文
共 50 条
  • [1] An algorithm for enumerating all directed spanning trees in a directed graph
    Uno, T
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 166 - 173
  • [2] An Algorithm for Enumerating All Spanning Trees of a Directed Graph
    S. Kapoor
    H. Ramesh
    Algorithmica, 2000, 27 : 120 - 130
  • [3] Faster enumeration of all spanning trees of a directed graph
    Hariharan, R
    Kapoor, S
    Kumar, V
    ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 428 - 439
  • [4] Enumerating spanning trees of a graph with edge constraints
    Guo, Jinshui
    Yan, Weigen
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 87 : 357 - 364
  • [5] Enumerating all spanning trees for pairwise comparisons
    Siraj, S.
    Mikhailov, L.
    Keane, J. A.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 191 - 199
  • [6] Finding All Breadth First Full Spanning Trees in a Directed Graph
    Khalil, Hoda
    Labiche, Yvan
    2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 2, 2017, : 372 - 377
  • [7] Enumerating spanning trees of vertex-edge-growth graph
    Ma, Fei
    Yao, Bing
    EPL, 2022, 138 (02)
  • [8] Matrix algorithm for enumerating all circuits of a graph
    Yahua, Yuan
    Yong, Li
    Ziguo, Wang
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 1992, 10 (02): : 210 - 218
  • [9] ALGORITHMS FOR ENUMERATING ALL SPANNING-TREES OF UNDIRECTED AND WEIGHTED GRAPHS
    KAPOOR, S
    RAMESH, H
    SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 247 - 265
  • [10] Simultaneously dominating all spanning trees of a graph
    Johann, Sebastian S.
    Krumke, Sven O.
    Streicher, Manuel
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2022, 10 (01) : 67 - 87
12345