Parameterized Complexity of Induced H-Matching on Claw-Free Graphs

The InducedH-Matching problem asks to find k disjoint, induced subgraphs isomorphic to H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes amongst others the classical Independent Set and Induced Matching problems. We show that InducedH-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph of constant size, and even admits a polynomial kernel when H is a clique. Both results rely on a new, strong algorithmic structure theorem for claw-free graphs. To show the fixed-parameter tractability of the problem, we additionally apply the color-coding technique in a nontrivial way. Complementing the above two positive results, we prove the W[1]-hardness of InducedH-Matching for graphs excluding K1,4 as an induced subgraph. In particular, we show that Independent Set is W[1]-hard on K1,4-free graphs.

[1]  Dániel Marx,et al.  Kernelization of packing problems , 2012, SODA.

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

[3]  Dániel Marx,et al.  Efficient Approximation Schemes for Geometric Problems? , 2005, ESA.

[4]  Hannes Moser,et al.  A Problem Kernelization for Graph Packing , 2009, SOFSEM.

[5]  Paul D. Seymour,et al.  The structure of claw-free graphs , 2005, BCC.

[6]  Noga Alon,et al.  Color-coding , 1995, JACM.

[7]  Xi Wu,et al.  Weak compositions and their applications to polynomial lower bounds for kernelization , 2012, SODA.

[8]  Dimitrios M. Thilikos,et al.  Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems , 2008, Algorithmica.

[9]  Andrew D. King,et al.  Bounding χ in terms of ω and Δ for quasi-line graphs , 2008 .

[10]  Christian Sloper,et al.  Looking at the stars , 2004, Theor. Comput. Sci..

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

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

[13]  Gianpaolo Oriolo,et al.  An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem , 2011, SODA '11.

[14]  Gianpaolo Oriolo,et al.  On the recognition of fuzzy circular interval graphs , 2012, Discret. Math..

[15]  Michal Pilipczuk,et al.  Dominating set is fixed parameter tractable in claw-free graphs , 2010, Theor. Comput. Sci..

[16]  Erik Jan van Leeuwen,et al.  Induced Disjoint Paths in Claw-Free Graphs , 2012, ESA.

[17]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[18]  Erik Jan van Leeuwen,et al.  Induced Disjoint Paths in AT-Free Graphs , 2012, SWAT.

[19]  Maria Chudnovsky,et al.  Coloring quasi-line graphs , 2007 .

[20]  Kathie Cameron,et al.  Independent packings in structured graphs , 2006, Math. Program..

[21]  David G. Kirkpatrick,et al.  On the Complexity of General Graph Factor Problems , 1981, SIAM J. Comput..

[22]  Joachim Kneis,et al.  Divide-and-Color , 2006, WG.

[23]  Udi Rotics,et al.  Finding Maximum Induced Matchings in Subclasses of Claw-Free and P5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size , 2003, Algorithmica.