Locally Excluding a Minor

We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph classes with bounded local tree-width. We show that first-order model-checking is fixed-parameter tractable on any class of graphs locally excluding a minor. This strictly generalises analogous results by Flum and Grohe on excluded minor classes and Frick and Grohe on classes with bounded local tree-width. As an important consequence of the proof we obtain fixed-parameter algorithms for problems such as dominating or independent set on graph classes excluding a minor, where now the parameter is the size of the dominating set and the excluded minor. We also study graph classes with excluded minors, where the minor may grow slowly with the size of the graphs and show that again, first-order model-checking is fixed-parameter tractable on any such class of graphs.

[1]  Jörg Flum,et al.  Fixed-Parameter Tractability, Definability, and Model-Checking , 1999, SIAM J. Comput..

[2]  Martin Grohe.  Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2003, Comb..

[3]  Paul D. Seymour,et al.  Graph Minors: XVII. Taming a Vortex , 1999, J. Comb. Theory, Ser. B.

[4]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[5]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Rasmus Ejlers Møgelberg,et al.  Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science , 2007 .

[7]  Erik D. Demaine,et al.  The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..

[8]  Martin Grohe,et al.  Fixed-parameter tractability and logic , 1999 .

[9]  Jaroslav Nesetril,et al.  The Grad of a Graph and Classes with Bounded Expansion , 2005, Electron. Notes Discret. Math..

[10]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[11]  Paul D. Seymour,et al.  Graph minors. VI. Disjoint paths across a disc , 1986, J. Comb. Theory, Ser. B.

[12]  Paul D. Seymour,et al.  Graph minors. XXI. Graphs with unique linkages , 2009, J. Comb. Theory, Ser. B.

[13]  Detlef Seese,et al.  Linear time computable problems and first-order descriptions , 1996, Mathematical Structures in Computer Science.

[14]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[15]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2004, J. Algorithms.

[16]  Dimitrios M. Thilikos,et al.  A Simple and Fast Approach for Solving Problems on Planar Graphs , 2004, STACS.

[17]  RobertsonNeil,et al.  Graph minors. XIII , 1994 .

[18]  Erik D. Demaine,et al.  Equivalence of local treewidth and linear local treewidth and its algorithmic applications , 2004, SODA '04.

[19]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[20]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[21]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[22]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[23]  H. Gaifman.  On Local and Non-Local Properties , 1982 .