The parameterized complexity of k-edge induced subgraphs

We prove that finding a k-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous Eureka theorem, and a generalization of the well-known fpt-algorithm for the model-checking problem for first-order logic on graphs with locally bounded tree-width due to Frick and Grohe. On the other hand, we show that two natural counting versions of the problem are hard. Hence, the k-edge induced subgraph problem is one of the very few known examples in parameterized complexity that are easy for decision while hard for counting.

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

[2]  George E. Andrews.  EϒPHKA! num = Δ + Δ + Δ , 1986 .

[3]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.

[4]  N. S. Barnett,et al.  Private communication , 1969 .

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

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

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

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

[9]  Hannes Moser,et al.  The parameterized complexity of the induced matching problem , 2009, Discret. Appl. Math..

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

[11]  Catherine McCartin.  Parameterized Counting Problems , 2002, MFCS.

[12]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

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

[14]  Michael Hoffmann,et al.  Chordless paths through three vertices , 2004, Theor. Comput. Sci..

[15]  Michael R. Fellows,et al.  Open Problems in Parameterized and Exact Computation - IWPEC 2006 , 2006 .

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

[17]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[18]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[19]  Ken-ichi Kawarabayashi,et al.  Detecting even holes , 2005, J. Graph Theory.

[20]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[21]  Yijia Chen,et al.  On Parameterized Path and Chordless Path Problems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[22]  Noga Alon,et al.  Graphs with a small number of distinct induced subgraphs , 1989, Discret. Math..

[23]  Yijia Chen,et al.  Understanding the Complexity of Induced Subgraph Isomorphisms , 2008, ICALP.

[24]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

[25]  Noga Alon,et al.  Avoiding small subgraphs in Achlioptas processes , 2009 .

[26]  Martin Grohe,et al.  An existential locality theorem , 2004, Ann. Pure Appl. Log..

[27]  Bruce A. Reed,et al.  A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory , 2013, SODA.

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

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

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

[31]  Stephan Kreutzer,et al.  Deciding first-order properties of nowhere dense graphs , 2013, STOC.

[32]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[33]  Martin Grohe,et al.  Computing crossing numbers in quadratic time , 2000, STOC '01.

[34]  Mihalis Yannakakis,et al.  On Limited Nondeterminism and the Complexity of the V-C Dimension , 1996, J. Comput. Syst. Sci..

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

[36]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..