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 条
  • [41] Multicommodity flow models for spanning trees with hop constraints
    Gouveia, L
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 95 (01) : 178 - 190
  • [42] An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
    Rafael A. Melo
    Phillippe Samer
    Sebastián Urrutia
    Computational Optimization and Applications, 2016, 65 : 821 - 844
  • [43] An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
    Melo, Rafael A.
    Samer, Phillippe
    Urrutia, Sebastian
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2016, 65 (03) : 821 - 844
  • [44] AN ALGORITHM TO GENERATE ALL TOPOLOGICAL SORTING ARRANGEMENTS
    VAROL, YL
    ROTEM, D
    COMPUTER JOURNAL, 1981, 24 (01): : 83 - 84
  • [45] Spanning Trees
    Akiyama, Jin
    Kano, Mikio
    FACTORS AND FACTORIZATIONS OF GRAPHS: PROOF TECHNIQUES IN FACTOR THEORY, 2011, 2031 : 295 - 336
  • [46] SPANNING TREES
    不详
    JOURNAL OF HUMANISTIC MATHEMATICS, 2021, 11 (02): : 481 - 482
  • [47] An improved clustering algorithm for minimum spanning trees in multidimensional data
    Xie, Zhi-Qiang
    Yu, Liang
    Yang, Jing
    Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2008, 29 (08): : 851 - 857
  • [48] A PARALLEL ALGORITHM FOR MULTIPLE UPDATES OF MINIMUM SPANNING-TREES
    PAWAGI, S
    PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 3: ALGORITHMS AND APPLICATIONS, 1989, : 9 - 15
  • [49] A faster FPT algorithm for finding spanning trees with many leaves
    Bonsma, PS
    Brueggemann, T
    Woeginger, GJ
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 259 - 268
  • [50] A SELF-STABILIZING ALGORITHM FOR CONSTRUCTING SPANNING-TREES
    CHEN, NS
    YU, HP
    HUANG, ST
    INFORMATION PROCESSING LETTERS, 1991, 39 (03) : 147 - 151
12345