Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2020.65
URN: urn:nbn:de:0030-drops-127557
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12755/
Lindermayr, Alexander ; Siebertz, Sebastian ; Vigny, Alexandre
Elimination Distance to Bounded Degree on Planar Graphs
| pdf-format: |
|
Abstract
We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph G and integers d and k decides in time f(k,d)⋅ n^c for a computable function f and constant c whether the elimination distance of G to the class of degree d graphs is at most k.
BibTeX - Entry
@InProceedings{lindermayr_et_al:LIPIcs:2020:12755,
author = {Alexander Lindermayr and Sebastian Siebertz and Alexandre Vigny},
title = {{Elimination Distance to Bounded Degree on Planar Graphs}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {65:1--65:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Javier Esparza and Daniel Kr{\'a}ľ},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12755},
URN = {urn:nbn:de:0030-drops-127557},
doi = {10.4230/LIPIcs.MFCS.2020.65},
annote = {Keywords: Elimination distance, parameterized complexity, structural graph theory}
}
| Keywords: | Elimination distance, parameterized complexity, structural graph theory | |
| Seminar: | 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 18.08.2020 |
