Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators

Abstract

VERTEX COVER is one of the most well studied problems in the realm of parameterized algorithms. It admits a kernel with O(ℓ2) edges and 2ℓ vertices where ℓ denotes the size of the vertex cover we are seeking for. A natural question is whether VERTEX COVER is fixed-parameter tractable or admits a polynomial kernel with respect to a parameter k, that is, provably smaller than the size of the vertex cover. Jansen and Bodlaender [STACS 2011, TOCS 2013] raised this question and gave a kernel for VERTEX COVER of size O(f3), where f is the size of a feedback vertex set of the input graph. We continue this line of work and study VERTEX COVER with respect to a parameter that is always smaller than the solution size and incomparable to the size of the feedback vertex set of the input graph. Our parameter is the number of vertices whose removal results in a graph of maximum degree two. While vertex cover with this parameterization can easily be shown to be fixed-parameter tractable (FPT), we show that it has a polynomial kernel. The input to our problem consists of an undirected graph G, S⊆V(G) such that |S|=k and G[V(G)∖S] has maximum degree at most two and a positive integer ℓ. Given (G,S,ℓ), in polynomial time we output an instance (G′,S′,ℓ′) such that |V(G′)| is O(k5), |E(G′)| is O(k6) and G has a vertex cover of size at most ℓ if and only if G′ has a vertex cover of size at most ℓ′. When G[V(G)∖S] has maximum degree at most one, we improve the known kernel bound from O(k3) vertices to O(k2) vertices (and O(k3) edges). More generally, given (G,S,ℓ) where every connected component of G∖S is a clique of at most d vertices (for constant d), in polynomial time, we output an equivalent instance (G′,S′,ℓ′) for the same problem where |V(G′)| is O(kd). We also show that for this problem, when d≥3, a kernel with O(kd−ε) bits cannot exist for any ε>0 unless NP⊆coNP/poly.