Treewidth: Algorithmic techniques and results
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 19-36
Abstract
No abstract availableKeywords
This publication has 102 references indexed in Scilit:
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Graph decompositions and tree automata in reasoning with uncertaintyJournal of Experimental & Theoretical Artificial Intelligence, 1993
- Finite automata, bounded treewidth and well-quasiordering1993
- Canonical representations of partial 2- and 3-treesBIT Numerical Mathematics, 1992
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Forbidden minors characterization of partial 3-treesDiscrete Mathematics, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986