Algorithms finding tree-decompositions of graphs
References (11)
- et al.
Linear time algorithms for NP-hard problems on graphs embedded in k-trees
Discrete Applied Math.
(1989) - et al.
Graph minors. III. Planar tree-width
J. Combin. Theory Ser. B
(1984) - et al.
Graph minors. IV. Tree-width and well quasi-ordering
J. Combin. Theory Ser. B
(1990) - et al.
Complexity of finding embeddings in a k-tree
SIAM J. Algebraic Discrete Methods
(1987) - et al.
Characterization and recognition of partial 3-trees
SIAM J. Algebraic Discrete Methods
(1985)
There are more references available in the full text version of this article.
Cited by (69)
On the complexity of the storyplan problem
2024, Journal of Computer and System SciencesMinimum size tree-decompositions
2017, Discrete Applied MathematicsCompleting colored graphs to meet a target property
2017, Discrete Applied MathematicsOnline promise problems with online width metrics
2007, Journal of Computer and System SciencesCutwidth II: Algorithms for partial w-trees of bounded degree
2005, Journal of AlgorithmsAn Improved Parameterized Algorithm for Treewidth
2023, Proceedings of the Annual ACM Symposium on Theory of Computing
- ∗
This research was carried out at Department of Mathematical Analysis, Charles University, Sokolovská 83, 186 00 Praha 8, Czechoslovakia.
Copyright © 1991 Published by Elsevier Inc.