Dominating set is fixed parameter tractable in claw-free graphs

We show that the Dominating Set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K"1","3, the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that uses 2^O^(^k^^^2^)n^O^(^1^) time and polynomial space to decide whether a claw-free graph on n vertices has a dominating set of size at most k. Note that this parameterization of Dominating Set is W[2]-hard on the set of all graphs, and thus is unlikely to have an FPT algorithm for graphs in general. The most general class of graphs for which an FPT algorithm was previously known for this parameterization of Dominating Set is the class of K"i","j-free graphs, which exclude, for some fixed i,j@?N, the complete bipartite graph K"i","j as a subgraph. For i,j>=2, the class of claw-free graphs and any class of K"i","j-free graphs are not comparable with respect to set inclusion. We thus extend the range of graphs over which this parameterization of Dominating Set is known to be fixed-parameter tractable. We also show that, in some sense, it is the presence of the claw that makes this parameterization of the Dominating Set problem hard. More precisely, we show that for any t>=4, the Dominating Set problem parameterized by the solution size is W[2]-hard in graphs that exclude the t-claw K"1","t as an induced subgraph. Our arguments also imply that the related Connected Dominating Set and Dominating Clique problems are W[2]-hard in these graph classes. Finally, we show that for any t@?N, the Clique problem parameterized by solution size, which is W[1]-hard on general graphs, is FPT in t-claw-free graphs. Our results add to the small and growing collection of FPT results for graph classes defined by excluded subgraphs, rather than by excluded minors.

[1]  Michael R. Fellows,et al.  The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus , 2002, SWAT.

[2]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

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

[4]  Paul D. Seymour,et al.  Claw-free graphs. III. Circular interval graphs , 2008, J. Comb. Theory, Ser. B.

[5]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[6]  Stasys Jukna,et al.  Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[7]  Stephan Kreutzer,et al.  Locally Excluding a Minor , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[8]  Eyal Amir,et al.  Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.

[9]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[10]  Noga Alon,et al.  Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs , 2007, Algorithmica.

[11]  Dimitrios M. Thilikos,et al.  Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.

[12]  Uwe Schöning,et al.  Complexity theory: current research , 1993 .

[13]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

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

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

[16]  Michael R. Fellows,et al.  The dominating set problem is fixed parameter tractable for graphs of bounded genus , 2004, J. Algorithms.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Paul D. Seymour,et al.  Claw-free graphs. I. Orientable prismatic graphs , 2007, J. Comb. Theory, Ser. B.

[19]  Paul D. Seymour,et al.  Claw-free graphs. IV. Decomposition theorem , 2008, J. Comb. Theory, Ser. B.

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

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

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

[23]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[24]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[25]  Paul D. Seymour,et al.  Claw-free graphs. V. Global structure , 2008, J. Comb. Theory, Ser. B.

[26]  Paul D. Seymour,et al.  Claw-free graphs VI. Colouring , 2010, J. Comb. Theory, Ser. B.

[27]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[28]  Stephan Kreutzer,et al.  Domination Problems in Nowhere-Dense Classes , 2009, FSTTCS.

[29]  Stasys Jukna,et al.  Extremal Combinatorics , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[30]  Robin Thomas,et al.  Deciding First-Order Properties for Sparse Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[31]  Zdenek Ryjácek,et al.  Claw-free graphs - A survey , 1997, Discret. Math..

[32]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[33]  Geevarghese Philip,et al.  Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels , 2009, ESA.

[34]  Moshe Lewenstein,et al.  Optimization problems in multiple-interval graphs , 2007, SODA '07.

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

[36]  Gideon Ehrlich,et al.  Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.

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

[38]  Paul D. Seymour,et al.  Claw-free graphs. II. Non-orientable prismatic graphs , 2008, J. Comb. Theory, Ser. B.

[39]  Erik Jan van Leeuwen,et al.  Domination When the Stars Are Out , 2010, ICALP.