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.2017.57
URN: urn:nbn:de:0030-drops-73891
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7389/
Giannopoulou, Archontia C. ;
Pilipczuk, Michal ;
Raymond, Jean-Florent ;
Thilikos, Dimitrios M. ;
Wrochna, Marcin
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
Abstract
Suppose F is a finite family of graphs. We consider the following meta-problem, called F-Immersion Deletion: given a graph G and an integer k, decide whether the deletion of at most k edges of G can result in a graph that does not contain any graph from F as an immersion. This problem is a close relative of the F-Minor Deletion problem studied by Fomin et al. [FOCS 2012], where one deletes vertices in order to remove all minor models of graphs from F.
We prove that whenever all graphs from F are connected and at least one graph of F is planar and subcubic, then the F-Immersion Deletion problem admits:
- a constant-factor approximation algorithm running in time O(m^3 n^3 log m)
- a linear kernel that can be computed in time O(m^4 n^3 log m) and
- a O(2^{O(k)} + m^4 n^3 log m)-time fixed-parameter algorithm,
where n,m count the vertices and edges of the input graph. Our findings mirror those of Fomin et al. [FOCS 2012], who obtained similar results for F-Minor Deletion, under the assumption that at least one graph from F is planar.
An important difference is that we are able to obtain a linear kernel for F-Immersion Deletion, while the exponent of the kernel of Fomin et al. depends heavily on the family F. In fact, this dependence is unavoidable under plausible complexity assumptions, as proven by Giannopoulou et al. [ICALP 2015]. This reveals that the kernelization complexity of F-Immersion Deletion is quite different than that of F-Minor Deletion.
BibTeX - Entry
@InProceedings{giannopoulou_et_al:LIPIcs:2017:7389,
author = {Archontia C. Giannopoulou and Michal Pilipczuk and Jean-Florent Raymond and Dimitrios M. Thilikos and Marcin Wrochna},
title = {{Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {57:1--57:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7389},
URN = {urn:nbn:de:0030-drops-73891},
doi = {10.4230/LIPIcs.ICALP.2017.57},
annote = {Keywords: Kernelization, Approximation, Immersion, Protrusion, Tree-cut width}
}
|
Keywords: |
|
Kernelization, Approximation, Immersion, Protrusion, Tree-cut width |
|
Collection: |
|
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
07.07.2017 |
