Incompressibility of H-Free Edge Modification

Given a fixed graph H, the H -Free Edge Deletion (resp., Completion, Editing) problems ask whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is H-free, i.e., contains no induced subgraph isomorphic to H. These H-free edge modification problems are well known to be FPT for every fixed H. In this paper, we study the nonexistence of polynomial kernels for them in terms of the structure of H, and completely characterize their nonexistence for H being paths, cycles or 3-connected graphs. As a very effective tool, we have introduced a constrained satisfiability problem Propagational Satisfiability to cope with the propagation of edge additions/deletions, and we expect the problem to be useful in studying the nonexistence of polynomial kernels.

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

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

[3]  Noga Alon,et al.  Solving MAX-r-SAT Above a Tight Lower Bound , 2009, SODA '10.

[4]  Jakob Rehof,et al.  Strong Normalization for Non-Structural Subtyping via Saturated Sets , 1996, Inf. Process. Lett..

[5]  Christophe Paul,et al.  On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems , 2010, Algorithmica.

[6]  Stefan Kratsch,et al.  Cross-Composition: A New Technique for Kernelization Lower Bounds , 2011, STACS.

[7]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

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

[9]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation , 2003, CIAC.

[10]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..

[11]  H. Bodlaender,et al.  Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels , 2008 .

[12]  Stefan Kratsch,et al.  Two edge modification problems without polynomial kernels , 2009, Discret. Optim..

[13]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..