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.ESA.2020.42
URN: urn:nbn:de:0030-drops-129088
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12908/
Eiben, Eduard ;
Lochet, William
A Polynomial Kernel for Line Graph Deletion
Abstract
The line graph of a graph G is the graph L(G) whose vertex set is the edge set of G and there is an edge between e,f ∈ E(G) if e and f share an endpoint in G. A graph is called line graph if it is a line graph of some graph. We study the Line-Graph-Edge Deletion problem, which asks whether we can delete at most k edges from the input graph G such that the resulting graph is a line graph. More precisely, we give a polynomial kernel for Line-Graph-Edge Deletion with O(k⁵) vertices. This answers an open question posed by Falk Hüffner at Workshop on Kernels (WorKer) in 2013.
BibTeX - Entry
@InProceedings{eiben_et_al:LIPIcs:2020:12908,
author = {Eduard Eiben and William Lochet},
title = {{A Polynomial Kernel for Line Graph Deletion}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12908},
URN = {urn:nbn:de:0030-drops-129088},
doi = {10.4230/LIPIcs.ESA.2020.42},
annote = {Keywords: Kernelization, line graphs, H-free editing, graph modification problem}
}
|
Keywords: |
|
Kernelization, line graphs, H-free editing, graph modification problem |
|
Collection: |
|
28th Annual European Symposium on Algorithms (ESA 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
26.08.2020 |
