Quickly deciding minor-closed parameters in general graphs

Authors:
Erik D. Demaine;Mohammad Taghi Hajiaghayi
Affiliations:
MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA;MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA
Venue:
European Journal of Combinatorics
Year:
2007

Citing 12
Cited 4

Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Graph minors. XII: distance on a surface

Journal of Combinatorial Theory Series B
Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Efficient Approximation for Triangulation of Minimum Treewidth

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensional Parameters and Local Treewidth

SIAM Journal on Discrete Mathematics
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Parameterized Complexity

Parameterized Complexity

On brambles, grid-like minors, and parameterized intractability of monadic second-order logic

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Polynomial treewidth forces a large grid-like-minor

European Journal of Combinatorics
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Large-treewidth graph decompositions and applications

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by N. Robertson, P.D. Seymour [Graph minors. XII. Distance on a surface, Journal of Combinatorial Theory, Series B 64 (2) (1995) 240-272; Graph minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B 92 (2) (2004) 325-357], M. Frick, M. Grohe [Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM 48 (6) (2001) 1184-1206], and M.R. Fellows, M.A. Langston [Nonconstructive tools for proving polynomial-time decidability, Journal of the ACM 35 (3) (1988) 727-739] toward obtaining fixed-parameter algorithms for a general class of parameters.