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 条
12345