A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- 1 December 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 25 (6) , 1305-1317
- https://doi.org/10.1137/s0097539793251219
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Parallel Algorithms with Optimal Speedup for Bounded TreewidthSIAM Journal on Computing, 1998
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of GraphsJournal of Algorithms, 1996
- Improved self-reduction algorithms for graphs with bounded treewidthDiscrete Applied Mathematics, 1994
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Finite automata, bounded treewidth and well-quasiorderingContemporary Mathematics, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Dynamic programming on graphs with bounded treewidthPublished by Springer Nature ,1988
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985