The parameterized complexity of the induced matching problem

Given a graph G and an integer k>=0, the NP-complete Induced Matching problem asks whether there exists an edge subset M of size at least k such that M is a matching and no two edges of M are joined by an edge of G. The complexity of this problem on general graphs, as well as on many restricted graph classes has been studied intensively. However, other than the fact that the problem is W[1]-hard on general graphs, little is known about the parameterized complexity of the problem in restricted graph classes. In this work, we provide first-time fixed-parameter tractability results for planar graphs, bounded-degree graphs, graphs with girth at least six, bipartite graphs, line graphs, and graphs of bounded treewidth. In particular, we give a linear-size problem kernel for planar graphs.

[1]  Nick Roussopoulos,et al.  A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..

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

[3]  Kathie Cameron,et al.  Finding a maximum induced matching in weakly chordal graphs , 2003, Discret. Math..

[4]  Miroslav Chlebík,et al.  Approximation Hardness of Dominating Set Problems , 2004, ESA.

[5]  F. Bruce Shepherd,et al.  Bipartite Domination and Simultaneous Matroid Covers , 2003, SIAM J. Discret. Math..

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

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

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

[9]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[10]  Hans L. Bodlaender,et al.  Treewidth: Characterizations, Applications, and Computations , 2006, WG.

[11]  Vadim V. Lozin.  On maximum induced matchings in bipartite graphs , 2002, Inf. Process. Lett..

[12]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[13]  Michael R. Fellows,et al.  The complexity of irredundant sets parameterized by size , 2000, Discret. Appl. Math..

[14]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..

[15]  Hannes Moser,et al.  Parameterized complexity of finding regular induced subgraphs , 2009, J. Discrete Algorithms.

[16]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[17]  Saket Saurabh,et al.  Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles , 2008, Algorithmica.

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

[19]  Henning Fernau,et al.  A parameterized perspective on packing paths of length two , 2009, J. Comb. Optim..

[20]  Dieter Rautenbach,et al.  Some results on graphs without long induced paths , 2003, Inf. Process. Lett..

[21]  Gerd Finke,et al.  Approximability results for the maximum and minimum maximal induced matching problems , 2008, Discret. Optim..

[22]  Jiong Guo,et al.  Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual , 2006, IWPEC.

[23]  Dimitrios M. Thilikos,et al.  Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up , 2004, ICALP.

[24]  Rolf Niedermeier,et al.  A General Data Reduction Scheme for Domination in Graphs , 2006, SOFSEM.

[25]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

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

[27]  Rolf Niedermeier,et al.  Linear Problem Kernels for NP-Hard Problems on Planar Graphs , 2007, ICALP.

[28]  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.

[29]  David Manlove,et al.  On the approximability of the maximum induced matching problem , 2005, J. Discrete Algorithms.

[30]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[31]  Vijay V. Vazirani,et al.  NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..

[32]  Martin Charles Golumbic,et al.  Irredundancy in Circular Arc Graphs , 1993, Discret. Appl. Math..

[33]  Ge Xia,et al.  On the Induced Matching Problem , 2008, STACS.

[34]  Moshe Lewenstein,et al.  Tighter Approximations for Maximum Induced Matchings in Regular Graphs , 2005, WAOA.

[35]  Ge Xia,et al.  On the induced matching problem , 2011, J. Comput. Syst. Sci..

[36]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[37]  Michael R. Fellows,et al.  The Lost Continent of Polynomial Time: Preprocessing and Kernelization , 2006, IWPEC.

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

[39]  Michele Zito.  Induced Matchings in Regular Graphs and Trees , 1999, WG.

[40]  Moshe Lewenstein,et al.  New results on induced matchings , 2000, Discret. Appl. Math..

[41]  Kathie Cameron,et al.  Induced Matchings in Intersection Graphs , 2000, Electron. Notes Discret. Math..

[42]  Rolf Niedermeier,et al.  Improved Tree Decomposition Based Algorithms for Domination-like Problems , 2002, LATIN.