TY - GEN

T1 - Finding independent spanning trees in partial k-trees

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84949817386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949817386&partnerID=8YFLogxK

U2 - 10.1007/3-540-40996-3_15

DO - 10.1007/3-540-40996-3_15

M3 - Conference contribution

AN - SCOPUS:84949817386

SN - 3540412557

SN - 9783540412557

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 168

EP - 179

BT - Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings

A2 - Lee, D.T.

A2 - Teng, Shang-Hua

A2 - Teng, Shang-Hua

PB - Springer Verlag

T2 - 11th Annual International Symposium on Algorithms and Computation, ISAAC 2000

Y2 - 18 December 2000 through 20 December 2000

ER -