Finding independent spanning trees in partial k-trees

被引：0
|
作者：
Zhou, X [1 ]
Nishizeki, T [1 ]
机构：
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808579, Japan
来源：
ALGORITHM AND COMPUTATION, PROCEEDINGS | 2001年 / 1969卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Spanning trees rooted at a vertex r of a graph G are independent if, for each vertex v in G, all the paths connecting v and r in the trees are pairwise internally disjoint. In this paper we give a linear-time algorithm to, find the maximum number of independent spanning trees rooted at any given vertex r in partial k-trees G, that is, graphs G with tree-width bounded by a constant k.
引用
收藏
页码：168 / 179
页数：12
相关论文
共 50 条
12345