Towards the Graph Minor Theorems for Directed Graphs
From MaRDI portal
Publication:3449461
DOI10.1007/978-3-662-47666-6_1zbMath1448.05189OpenAlexW770376631MaRDI QIDQ3449461
Ken-ichi Kawarabayashi, Stephan Kreutzer
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_1
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The disjoint paths problem in quadratic time
- Linearity of grid minors in treewidth with applications through bidimensionality
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. V. Excluding a planar graph
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- The directed subgraph homeomorphism problem
- Highly connected sets and the excluded grid theorem
- Quickly excluding a planar graph
- Packing directed circuits
- Directed tree-width
- Graph minors. XIII: The disjoint paths problem
- Tree-width and planar minors
- A shorter proof of the graph minor algorithm
- The Directed Grid Theorem
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- Finding k Disjoint Paths in a Directed Planar Graph
- Polynomial bounds for the grid-minor theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Bidimensional Parameters and Local Treewidth
- An Excluded Grid Theorem for Digraphs with Forbidden Minors
- Finding topological subgraphs is fixed-parameter tractable
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithms - ESA 2003
