Exploring the kernelization borders for hitting cycles

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

A generalization of classical cycle hitting problems, called conflict version of the problem, is defined as follows. An input is undirected graphs G and H on the same vertex set, and a positive integer k, and the objective is to decide whether there exists a vertex subset X ? V (G) such that it intersects all desired “cycles” (all cycles or all odd cycles or all even cycles) and X is an independent set in H. In this paper we study the conflict version of classical Feedback Vertex Set, and Odd Cycle Transversal problems, from the view point of kernelization complexity. In particular, we obtain the following results, when the conflict graph H belongs to the family of d-degenerate graphs. 1. CF-FVS admits a O(kO(d)) kernel. 2. CF-OCT does not admit polynomial kernel (even when H is 1-degenerate), unless NP ? coNPpoly . For our kernelization algorithm we exploit ideas developed for designing polynomial kernels for the classical Feedback Vertex Set problem, as well as, devise new reduction rules that exploit degeneracy crucially. Our main conceptual contribution here is the notion of “k-independence preserver”. Informally, it is a set of “important” vertices for a given subset X ? V (H), that is enough to capture the independent set property in H. We show that for d-degenerate graph independence preserver of size kO(d) exists, and can be used in designing polynomial kernel.

Original languageEnglish
Title of host publication13th International Symposium on Parameterized and Exact Computation, IPEC 2018
EditorsChristophe Paul, Michal Pilipczuk
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770842
DOIs
StatePublished - 1 Jan 2019
Externally publishedYes
Event13th International Symposium on Parameterized and Exact Computation, IPEC 2018 - Helsinki, Finland
Duration: 22 Aug 201824 Aug 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume115
ISSN (Print)1868-8969

Conference

Conference13th International Symposium on Parameterized and Exact Computation, IPEC 2018
Country/TerritoryFinland
CityHelsinki
Period22/08/1824/08/18

Keywords

  • Conflict-free problems
  • Even Cycle Transversal
  • Feedback Vertex Set
  • Kernelization
  • Odd Cycle Transversal
  • Parameterized Complexity

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Exploring the kernelization borders for hitting cycles'. Together they form a unique fingerprint.

Cite this