## Abstract

We know that TREE CONTRACTION does not admit a polynomial kernel unless NP ⊆ coNP/poly, while PATH CONTRACTION admits a kernel with O(k) vertices. The starting point of this article is the following natural questions: What is the structure of the family of paths that allows PATH CONTRACTION to admit a polynomial kernel? Apart from the size of the solution, what other additional parameters should we consider so we can design polynomial kernels for these basic contraction problems? To design polynomial kernels, we consider the family of trees with the bounded number of leaves (note that the family of paths are trees with at most two leaves). In particular, we study BOUNDED TREE CONTRACTION. Here, an input is a graph G, integers k and ℓ, and the goal is to decide whether, there is a subset F⊆E(G) of size at most k such that G/F is a tree with at most ℓ leaves. We design a kernel with O(kℓ) vertices and O(k^{2}+kℓ) edges for this problem. We complement this result by giving kernelization lower bound. We also prove similar results for BOUNDED OUT-TREE CONTRACTION and BOUNDED CACTUS CONTRACTION.

Original language | English |
---|---|

Pages (from-to) | 98-116 |

Number of pages | 19 |

Journal | Theoretical Computer Science |

Volume | 860 |

DOIs | |

State | Published - 8 Mar 2021 |

## Keywords

- Graph contraction
- Kernel
- Kernel lower bound

## ASJC Scopus subject areas

- Theoretical Computer Science
- General Computer Science