Parameterized complexity of finding regular induced subgraphs

The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced subgraph in which every vertex has degree exactly r. In this paper we examine its parameterization k-Sizer-Regular Induced Subgraph with k as parameter and prove that it is W[1]-hard. We also examine the parameterized complexity of the dual parameterized problem, namely, the k-Almostr-Regular Graph problem, which asks for a given graph G and a non-negative integer k whether G can be made r-regular by deleting at most k vertices. For this problem, we prove the existence of a problem kernel of size O(kr(r+k)^2).

[1]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[2]  Norman Biggs.  Algebraic Graph Theory: Index , 1974 .

[3]  Dániel Marx.  Chordal Deletion is Fixed-Parameter Tractable , 2008, Algorithmica.

[4]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[5]  Rolf Niedermeier,et al.  Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.

[6]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

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

[8]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[9]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[10]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[11]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.

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

[13]  Dimitrios M. Thilikos,et al.  Fast FPT-Algorithms for Cleaning Grids , 2006, STACS.

[14]  Iain A. Stewart.  On locating cubic subgraphs in bounded-degree connected bipartite graphs , 1997, Discret. Math..

[15]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[16]  Bruce A. Reed,et al.  Planar graph bipartization in linear time , 2008, Discret. Appl. Math..

[17]  Vadim V. Lozin,et al.  Maximum k-regular induced subgraphs , 2007, J. Comb. Optim..

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

[19]  Stephen A. Cook,et al.  Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.

[20]  Iain A. Stewart.  Deciding whether a planar graph has a cubic subgraph is NP-complete , 1994, Discret. Math..

[21]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, STOC.

[22]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[23]  Stefan Szeider,et al.  Parameterized Graph Editing with Chosen Vertex Degrees , 2008, COCOA.

[24]  Stefan Szeider,et al.  The Parameterized Complexity of Regular Subgraph Problems and Generalizations , 2008, CATS.

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

[26]  Iain A. Stewart.  Finding Regular Subgraphs in Both Arbitrary and Planar Graphs , 1996, Discret. Appl. Math..