Graph minors. II. Algorithmic aspects of tree-width
- 3 September 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (3), 309-322
- https://doi.org/10.1016/0196-6774(86)90023-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- 2-Linked GraphsEuropean Journal of Combinatorics, 1980
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- Disjoint paths in graphsDiscrete Mathematics, 1980
- The equivalence of theorem proving and the interconnection problemACM SIGDA Newsletter, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975