Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2018.10
URN: urn:nbn:de:0030-drops-94732
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9473/
Cao, Yixin ; Rai, Ashutosh ; Sandeep, R. B. ; Ye, Junjie
A Polynomial Kernel for Diamond-Free Editing
| pdf-format: |
|
Abstract
Given a fixed graph H, the H-free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of H. We obtain a polynomial kernel for this problem when H is a diamond. The incompressibility dichotomy for H being a 3-connected graph and the classical complexity dichotomy suggest that except for H being a complete/empty graph, H-free editing problems admit polynomial kernels only for a few small graphs H. Therefore, we believe that our result is an essential step toward a complete dichotomy on the compressibility of H-free editing. Additionally, we give a cubic-vertex kernel for the diamond-free edge deletion problem, which is far simpler than the previous kernel of the same size for the problem.
BibTeX - Entry
@InProceedings{cao_et_al:LIPIcs:2018:9473,
author = {Yixin Cao and Ashutosh Rai and R. B. Sandeep and Junjie Ye},
title = {{A Polynomial Kernel for Diamond-Free Editing}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {10:1--10:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Yossi Azar and Hannah Bast and Grzegorz Herman},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9473},
URN = {urn:nbn:de:0030-drops-94732},
doi = {10.4230/LIPIcs.ESA.2018.10},
annote = {Keywords: Kernelization, Diamond-free, H-free editing, Graph modification problem}
}
| Keywords: | Kernelization, Diamond-free, H-free editing, Graph modification problem | |
| Seminar: | 26th Annual European Symposium on Algorithms (ESA 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 14.08.2018 |
