Algorithms finding tree-decompositions of graphs
- 31 March 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (1) , 1-22
- https://doi.org/10.1016/0196-6774(91)90020-y
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Graph minors. IV. Tree-width and well-quasi-orderingJournal of Combinatorial Theory, Series B, 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
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983