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 条

[1] COMPLETELY INDEPENDENT SPANNING TREES IN (PARTIAL) k-TREES
Matsushita, Masayoshi
Otachi, Yota
Araki, Toru
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (03) : 427 - 437
[2] Closure and Spanning k-Trees
Matsubara, Ryota
Tsugaki, Masao
Yamashita, Tomoki
[J]. GRAPHS AND COMBINATORICS, 2014, 30 (04) : 957 - 962
[3] Closure and Spanning k-Trees
Ryota Matsubara
Masao Tsugaki
Tomoki Yamashita
[J]. Graphs and Combinatorics, 2014, 30 : 957 - 962
[4] ON SOME OPTIMIZATION PROBLEMS ON K-TREES AND PARTIAL K-TREES
GRANOT, D
SKORINKAPOV, D
[J]. DISCRETE APPLIED MATHEMATICS, 1994, 48 (02) : 129 - 145
[5] Spanning k-trees of Bipartite Graphs
Kano, Mikio
Ozeki, Kenta
Suzuki, Kazuhiro
Tsugaki, Masao
Yamashit, Tomoki
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
[6] A linear algorithm for finding total colorings of partial k-trees
Isobe, S
Zhou, X
Nishizeki, T
[J]. ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 347 - 356
[7] ON THE COMPLEXITY OF FINDING ISOMORPHISMS AND OTHER MORPHISMS FOR PARTIAL K-TREES
MATOUSEK, J
THOMAS, R
[J]. DISCRETE MATHEMATICS, 1992, 108 (1-3) : 343 - 364
[8] Finding edge-disjoint paths in partial k-trees
Zhou, X
Tamura, S
Nishizeki, T
[J]. ALGORITHMICA, 2000, 26 (01) : 3 - 30
[9] Finding edge-disjoint paths in partial k-trees
Zhou, XA
Tamura, S
Nishizeki, T
[J]. ALGORITHMS AND COMPUTATION, 1996, 1178 : 203 - 212
[10] Forbidden subgraphs and the existence of spanning k-trees
Ota, Katsuhiro
Sugiyama, Takeshi
[J]. DISCRETE MATHEMATICS, 2010, 310 (24) : 3506 - 3511

← 1 2 3 4 5 →