An algorithm to generate all spanning trees with flow

被引：4
|
作者：
Lin, YK [1 ]
机构：
[1] Van Nung Inst Technol, Dept Informat Management, Tao Yuan 320, Taiwan
来源：
MATHEMATICAL AND COMPUTER MODELLING | 2002年 / 35卷 / 13期
关键词：
spanning tree; flow; minimal path; undirected network;
D O I：
10.1016/S0895-7177(02)00096-1
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Spanning tree enumeration in undirected graphs is an important issue and task in many problems encountered in computer network and circuit analysis. This paper discusses the spanning tree with flow for the case that there are flow requirements between each node pair. An algorithm based on minimal paths (MPs) is proposed to generate all spanning trees without flow. The proposed algorithm is a structured approach, which splits the system into structural MPs first, and also all steps in it are easy to follow. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：1453 / 1458
页数：6
相关论文
共 50 条
  • [21] Listing all the minimum spanning trees in an undirected graph
    Yamada, Takeo
    Kataoka, Seiji
    Watanabe, Kohtaro
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (14) : 3175 - 3185
  • [22] Faster enumeration of all spanning trees of a directed graph
    Hariharan, R
    Kapoor, S
    Kumar, V
    ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 428 - 439
  • [23] GOOD ALGORITHM FOR SMALLEST SPANNING TREES WITH A DEGREE CONSTRAINT
    GABOW, HN
    NETWORKS, 1978, 8 (03) : 201 - 208
  • [24] A fast distributed approximation algorithm for minimum spanning trees
    Khan, Maleq
    Pandurangan, Gopal
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 355 - +
  • [25] A parallel algorithm for k-minimum spanning trees
    Ma, J
    Iwama, K
    Gu, QP
    SECOND AIZU INTERNATIONAL SYMPOSIUM ON PARALLEL ALGORITHMS/ARCHITECTURE SYNTHESIS, PROCEEDINGS, 1997, : 384 - 388
  • [26] Constructive Algorithm of Independent Spanning Trees on Mobius Cubes
    Cheng, Baolei
    Fan, Jianxi
    Jia, Xiaohua
    Zhang, Shukui
    Chen, Bangrui
    COMPUTER JOURNAL, 2013, 56 (11): : 1347 - 1362
  • [27] A table based algorithm for minimum directed spanning trees
    Feng, J.
    2001, Editorial Dept. of Systems Engineering and Electronics (12)
  • [28] An I/O Efficient Algorithm for Minimum Spanning Trees
    Bhushan, Alka
    Sajith, Gopalan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 499 - 509
  • [29] A PARALLEL ALGORITHM FOR THE ENUMERATION OF THE SPANNING-TREES OF A GRAPH
    MAI, SW
    EVANS, DJ
    PARALLEL COMPUTING, 1984, 1 (3-4) : 275 - 286
  • [30] DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING TREES.
    Dalal, Yogen K.
    IEEE Transactions on Software Engineering, 1987, SE-13 (03) : 398 - 405
12345