Kernel Bounds for Structural Parameterizations of Pathwidth

摘要

Assuming the AND-distillation conjecture, the PATHWIDTH problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k. The present work studies the existence of polynomial kernels for PATHWIDTH with respect to other, structural, parameters. Our main result is that, unless NP C coNP/poly, PATHWIDTH admits no polynomial kernelization even when parameterized by the vertex deletion distance to a clique, by giving a cross-composition from CUTWIDTH. The cross-composition works also for TREEWIDTH, improving over previous lower bounds by the present authors. For PATHWIDTH, our result rules out polynomial kernels with respect to the distance to various classes of polynomial-time solvable inputs, like interval or cluster graphs. This leads to the question whether there are nontrivial structural parameters for which PATHWIDTH does admit a polynomial kernelization. To answer this, we give a collection of graph reduction rules that are safe for PATHWIDTH. We analyze the success of these results and obtain polynomial kernelizations with respect to the following parameters: the size of a vertex cover of the graph, the vertex deletion distance to a graph where each connected component is a star, and the vertex deletion distance to a graph where each connected component has at most c vertices.