Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Published 27 Apr 2020 in cs.DS, cs.CC, and math.CO | (2004.12865v2)

Abstract: We study the kernelization complexity of structural parameterizations of the Vertex Cover problem. Here, the goal is to find a polynomial-time preprocessing algorithm that can reduce any instance (G,k)(G,k) of the Vertex Cover problem to an equivalent one, whose size is polynomial in the size of a pre-determined complexity parameter of GG. A long line of previous research deals with parameterizations based on the number of vertex deletions needed to reduce GG to a member of a simple graph class F\mathcal{F}, such as forests, graphs of bounded tree-depth, and graphs of maximum degree two. We set out to find the most general graph classes F\mathcal{F} for which Vertex Cover parameterized by the vertex-deletion distance of the input graph to F\mathcal{F}, admits a polynomial kernelization. We give a complete characterization of the minor-closed graph families F\mathcal{F} for which such a kernelization exists. We introduce a new graph parameter called bridge-depth, and prove that a polynomial kernelization exists if and only if F\mathcal{F} has bounded bridge-depth. The proof is based on an interesting connection between bridge-depth and the size of minimal blocking sets in graphs, which are vertex sets whose removal decreases the independence number.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.