Chapter 8 Algorithmic implications of the graph minor theorem
- 1 January 1995
- book chapter
- Published by Elsevier
- Vol. 7, 481-502
- https://doi.org/10.1016/s0927-0507(05)80125-2
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Quickly excluding a forestJournal of Combinatorial Theory, Series B, 1991
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Monotonicity in graph searchingJournal of Algorithms, 1991
- On embedding graphs in treesJournal of Combinatorial Theory, Series B, 1990
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Cost Trade-offs in Graph Embeddings, with ApplicationsJournal of the ACM, 1983
- 103 Graphs that are irreducible for the projective planeJournal of Combinatorial Theory, Series B, 1979
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974