A linear time algorithm for finding tree-decompositions of small treewidth

A linear time algorithm for finding tree-decompositions of small treewidth (2001)

Cached

Download Links

by Hans L. Bodlaender

Citations:

BibTeX

@MISC{Bodlaender01alinear,
    author = {Hans L. Bodlaender},
    title = {A linear time algorithm for finding tree-decompositions of small treewidth},
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

267	Complexity of finding embeddings in a k-tree - Arnborg, Corneil, et al. - 1987
203	Easy problems for treedecomposable graphs - Arnborg, Lagergren, et al. - 1991
183	Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey - Arnborg - 1985
167	A tourist guide through treewidth - Bodlaender - 1993
130	Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Math - Proskurowski, Arnborg - 1989
63	An algebraic theory of graph reduction - Arnborg, Courcelle, et al. - 1993
42	Finite automata, bounded treewidth and wellquasiordering - Abrahamson, Fellows - 1993
34	Complexity of nding embeddings in a k-tree - Arnborg, Corneil, et al. - 1987
31	Dynamic programming algorithms on graphs with bounded treewidth - Bodlaender - 1988
25	Better algorithms for the pathwidth and treewidth of graphs - Bodlaender, Kloks
11	Improved self-reduction algorithms for graphs with bounded treewidth - Bodlaender
1	Unpublished results - Bodlaender, Fellows, et al. - 1993