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 条

[11] Expanders Are Universal for the Class of All Spanning Trees
Johannsen, Daniel
Krivelevich, Michael
Samotij, Wojciech
COMBINATORICS PROBABILITY & COMPUTING, 2013, 22 (02): : 253 - 281
[12] 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
[13] Enumerating all spanning trees for pairwise comparisons
Siraj, S.
Mikhailov, L.
Keane, J. A.
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 191 - 199
[14] Using Lagrangian dual information to generate degree constrained spanning trees
Andrade, R
Lucena, A
Maculan, N
DISCRETE APPLIED MATHEMATICS, 2006, 154 (05) : 703 - 717
[15] The Complexity and Algorithm for Minimum Expense Spanning Trees
Zhan Ning
Wu Longshu
2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 118 - 122
[16] A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
Zhang, Jian
Yuan, Xiaodong
Yuan, Yubo
JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY, 2014, 2 (02) : 143 - 149
[17] A Table Based Algorithm for MinimumDirected Spanning Trees
Feng Junwen School of Economics and Management
Journal of Systems Engineering and Electronics, 2001, (01) : 22 - 28
[18] NEW ALGORITHM FOR GENERATION OF SPANNING-TREES
CHERKASSKII, BV
CYBERNETICS, 1987, 23 (01): : 107 - 113
[19] A faster deterministic algorithm for minimum spanning trees
Chazelle, B
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 22 - 34
[20] IMPROVED ALGORITHM FOR CONSTRUCTION OF MINIMAL SPANNING TREES
PYNN, C
WARREN, JH
ELECTRONICS LETTERS, 1972, 8 (06) : 143 - &

← 1 2 3 4 5 →