Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
From MaRDI portal
Publication:764332
DOI10.1016/j.tcs.2011.09.014zbMath1241.05027MaRDI QIDQ764332
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.014
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Graph minors. XVI: Excluding a non-planar graph
- Diameter and treewidth in minor-closed graph families
- The extremal function for complete minors
- A characterization of weakly bipartite graphs
- Graph minors. XIII: The disjoint paths problem
- Parametrized complexity theory.
- Local tree-width, excluded minors, and approximation algorithms
- On the odd-minor variant of Hadwiger's conjecture
- An O ( n log n ) approximation scheme for Steiner tree in planar graphs
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
- Planar Subgraph Isomorphism Revisited
- Deciding first-order properties of locally tree-decomposable structures
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- A Separator Theorem for Nonplanar Graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Parameterized complexity: exponential speed-up for planar graph problems