A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs

被引：0
|
作者：
T. Matsui
机构：
[1] Department of Mathematical Engineering and Information Physics,
[2] Faculty of Engineering,undefined
[3] University of Tokyo,undefined
[4] Bunkyo-ku,undefined
[5] Tokyo 113,undefined
[6] Japan. tomomi@misojiro.t.u-tokyo.ac.jp.,undefined
来源：
Algorithmica | 1997年 / 18卷
关键词：
Key words. Enumeration problem, Spanning tree.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we propose an algorithm for generating all the spanning trees in undirected graphs. The algorithm requires O (n+m+ τ n) time where the given graph has n vertices, m edges, and τ spanning trees. For outputting all the spanning trees explicitly, this time complexity is optimal.
引用
收藏
页码：530 / 543
页数：13
相关论文
共 50 条
12345