Finding Independent Spanning Trees in Partial k-Trees

Authors:
Xiao Zhou;Takao Nishizeki
Affiliations:
-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 8
Cited 0

The multi-tree approach to reliability in distributed networks

Information and Computation
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

Journal of Algorithms
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Independent spanning trees of chordal rings

Information Processing Letters
Parallel Algorithms with Optimal Speedup for Bounded Treewidth

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Independent Spanning Trees of Product Graphs

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Reliable broadcasting in product networks with Byzantine faults

FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.