On computing graph minor obstruction sets
From MaRDI portal
Publication:1575945
DOI10.1016/S0304-3975(97)00300-9zbMath0952.68116MaRDI QIDQ1575945
Michael J. Dinneen, Kevin Cattell, Michael R. Fellows, Rodney G. Downey, Michael A. Langston
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
03D05: Automata and formal grammars in connection with logical questions
05C99: Graph theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple linear-time algorithm for finding path-decompositions of small width
- Graph minors. XX: Wagner's conjecture
- Graph minors. I. Excluding a forest
- Quickly excluding a forest
- Obstruction set isolation for the gate matrix layout problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Nonconstructive tools for proving polynomial-time decidability
- Bounding the Size of Planar Intertwines
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width
- Obstructions to within a few vertices or edges of acyclic
- Two strikes against perfect phylogeny