License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.110
URN: urn:nbn:de:0030-drops-91146
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9114/
Go to the corresponding LIPIcs Volume Portal


Lokshtanov, Daniel ; Ramanujan, M. S. ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS

pdf-format:
LIPIcs-ICALP-2018-110.pdf (0.4 MB)


Abstract

In the Directed Feedback Vertex Set (DFVS) problem, we are given as input a directed graph D and an integer k, and the objective is to check whether there exists a set S of at most k vertices such that F=D-S is a directed acyclic graph (DAG). Determining whether DFVS admits a polynomial kernel (parameterized by the solution size) is one of the most important open problems in parameterized complexity. In this article, we give a polynomial kernel for DFVS parameterized by the solution size plus the size of any treewidth-eta modulator, for any positive integer eta. We also give a polynomial kernel for the problem, which we call Vertex Deletion to treewidth-eta DAG, where given as input a directed graph D and a positive integer k, the objective is to decide whether there exists a set of at most k vertices, say S, such that D-S is a DAG and the treewidth of D-S is at most eta.

BibTeX - Entry

@InProceedings{lokshtanov_et_al:LIPIcs:2018:9114,
  author =	{Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh and Roohani Sharma and Meirav Zehavi},
  title =	{{Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{110:1--110:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9114},
  URN =		{urn:nbn:de:0030-drops-91146},
  doi =		{10.4230/LIPIcs.ICALP.2018.110},
  annote =	{Keywords: Polynomial Kernel, Directed Feedback Vertex Set, Treewidth Modulator}
}

Keywords: Polynomial Kernel, Directed Feedback Vertex Set, Treewidth Modulator
Collection: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 04.07.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI