Abstract
This work further explores the applications of co-nondeterminism for showing kernelization lower bounds. The only known example prior to this work excludes polynomial kernelizations for the so-called Ramsey problem of finding an independent set or a clique of at least k vertices in a given graph [Kratsch 2012]. We study the more general problem of finding induced subgraphs on k vertices fulfilling some hereditary property Π, called Π-Induced Subgraph. The problem is NP-hard for all nontrivial choices of Π by a classic result of Lewis and Yannakakis [1980]. The parameterized complexity of this problem was classified by Khot and Raman [2002] depending on the choice of Π. The interesting cases for kernelization are for Π containing all independent sets and all cliques, since the problem is trivially polynomial time solvable or W[1]-hard otherwise.
Our results are twofold. Regarding Π-Induced Subgraph, we show that for a large choice of natural graph properties Π, including chordal, perfect, cluster, and cograph, there is no polynomial kernel with respect to k. This is established by two theorems, each one capturing different (but not necessarily exclusive) sets of properties: one using a co-nondeterministic variant of OR-cross-composition and one by a polynomial parameter transformation from Ramsey.
Additionally, we show how to use improvement versions of NP-hard problems as source problems for lower bounds, without requiring their NP-hardness. For example, for Π-Induced Subgraph our compositions may assume existing solutions of size k--1. This follows from the more general fact that source problems for OR-(cross-)compositions need only be NP-hard under co-nondeterministic reductions. We believe this to be useful for further lower-bound proofs, for example, since improvement versions simplify the construction of a disjunction (OR) of instances required in compositions. This adds a second way of using co-nondeterminism for lower bounds.
- Noga Alon, János Pach, and József Solymosi. 2001. Ramsey-type theorems with forbidden subgraphs. Combinatorica 21, 2, 155--170.Google Scholar
- Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. 2009. On problems without polynomial kernels. J. Comput. System Sci. 75, 8, 423--434. Google Scholar
Digital Library
- Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. 2014. Kernelization lower bounds by cross-composition. SIAM J. Disc. Math. 28, 1, 277--305.Google Scholar
Cross Ref
- Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. 2011. Kernel bounds for disjoint cycles and disjoint paths. Theoret. Comput. Sci. 412, 35, 4570--4578. Google Scholar
Digital Library
- Leizhen Cai. 1996. Fixed-parameter tractability of graph modification problems for hereditary properties. Inform. Process. Lett. 58, 171--176. Google Scholar
Digital Library
- Holger Dell and Dániel Marx. 2012. Kernelization of packing problems. In Proceedings of SODA. 68--81. Google Scholar
Digital Library
- Holger Dell and Dieter van Melkebeek. 2010. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In Proceedings of STOC. 251--260. Google Scholar
Digital Library
- Reinhard Diestel. 2005. Graph Theory. Springer.Google Scholar
- Michael Dom, Daniel Lokshtanov, and Saket Saurabh. 2009. Incompressibility through colors and IDs. In Proceedings of ICALP (1). 378--389. Google Scholar
Digital Library
- Paul Erdős. 1947. Some remarks on the theory of graphs. Bull. Amer. Math. Soc. 53, 292--294.Google Scholar
Cross Ref
- Paul Erdős and András Hajnal. 1989. Ramsey-type theorems. Disc. Appl. Math. 25, 1--2, 37--52. Google Scholar
Digital Library
- Paul Erdős and George Szekeres. 1935. A combinatorial problem in geometry. Compositio Mathematica 2, 463--470.Google Scholar
- Fedor V. Fomin, Saket Saurabh, and Yngve Villanger. 2013. A polynomial kernel for proper interval vertex deletion. SIAM J. Disc. Math. 27, 4, 1964--1976.Google Scholar
Cross Ref
- Lance Fortnow and Rahul Santhanam. 2011. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. System Sci. 77, 1, 91--106. Google Scholar
Digital Library
- Martin C. Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs, 2nd Ed. Elsevier Science. Google Scholar
Digital Library
- Danny Harnik and Moni Naor. 2010. On the compressibility of NP instances and cryptographic applications. SIAM J. Comput. 39, 5, 1667--1713. Google Scholar
Digital Library
- Danny Hermelin and Xi Wu. 2012. Weak compositions and their applications to polynomial lower bounds for kernelization. In Proceedings of SODA. 104--113. Google Scholar
Digital Library
- Subhash Khot and Venkatesh Raman. 2002. Parameterized complexity of finding subgraphs with hereditary properties. Theor. Computer Science 289, 2, 997--1008. Google Scholar
Digital Library
- Stefan Kratsch. 2012. Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem. In Proceedings of SODA. 114--122. Google Scholar
Digital Library
- Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, and Venkatesh Raman. 2012. Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs. In Proceedings of SWAT. 364--375. Google Scholar
Digital Library
- John M. Lewis and Mihalis Yannakakis. 1980. The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci. 20, 2, 219--230.Google Scholar
Cross Ref
- László Lovasz. 1983. Perfect graphs. In Selected Topics in Graph Theory, Volume 2, L. W. Beineke and R. J. Wilson (Eds.), Academic Press, London-New York, 55--67.Google Scholar
- Dániel Marx. 2010. Chordal deletion is fixed-parameter tractable. Algorithmica 57, 4, 747--768. Google Scholar
Digital Library
- Dániel Marx and Ildikó Schlotter. 2012. Obtaining a planar graph by vertex deletion. Algorithmica 62, 3--4, 807--822. Google Scholar
Digital Library
- René van Bevern, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier. 2010. Measuring indifference: Unit interval vertex deletion. In Proceedings of WG. 232--243. Google Scholar
Digital Library
- Pim van ’t Hof and Yngve Villanger. 2013. Proper interval vertex deletion. Algorithmica 65, 4, 845--867.Google Scholar
Digital Library
Index Terms
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs
Recommendations
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
SWAT'12: Proceedings of the 13th Scandinavian conference on Algorithm TheoryThis work further explores the applications of co-nondeterminism for showing kernelization lower bounds. The only known example excludes polynomial kernelizations for the Ramsey problem of finding an independent set or a clique of at least k vertices in ...
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
Kernelization is a strong and widely applied technique in parameterized complexity. In a nutshell, a kernelization algorithm for a parameterized problem transforms in polynomial time a given instance of the problem into an equivalent instance whose size ...
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
Fundamentals of Computation TheoryAbstractWe investigate the parameterized complexity of finding subgraphs with hereditary properties on graphs belonging to a hereditary graph class. Given a graph G, a non-trivial hereditary property and an integer parameter k, the general problem






Comments