Quickly deciding minor-closed parameters in general graphs
From MaRDI portal
Publication:854832
DOI10.1016/J.EJC.2005.07.003zbMATH Open1105.05065OpenAlexW1973646572MaRDI QIDQ854832FDOQ854832
Authors: Erik D. Demaine, Mohammad T. Hajiaghayi 
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.003
Recommendations
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
- Graph minors and parameterized algorithm design
- The complexity of learning minor closed graph classes
- scientific article; zbMATH DE number 5874803
- k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
- Fast separation in a graph with an excluded minor
- Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
- Optimizing the graph minors weak structure theorem
- Faster parameterized algorithms for minor containment
- Faster parameterized algorithms for minor containment
Cites Work
- Graph minors. XX: Wagner's conjecture
- Graph minors. XIII: The disjoint paths problem
- Nonconstructive tools for proving polynomial-time decidability
- Quickly excluding a planar graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding first-order properties of locally tree-decomposable structures
- Bidimensionality: new connections between FPT algorithms and PTASs
- Title not available (Why is that?)
- Graph minors. XII: Distance on a surface
- Bidimensional Parameters and Local Treewidth
- Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
Cited In (5)
This page was built for publication: Quickly deciding minor-closed parameters in general graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854832)
