Abstract
In this paper, we present an algorithm for computing a feedback vertex set of a unit disk graph of size k, if it exists, which runs in time 2^O(√k)(n+m), where n and m denote the numbers of vertices and edges, respectively. This improves the 2^O(√klog k) n^O(1)-time algorithm for this problem on unit disk graphs by Fomin et al. [ICALP 2017]. Moreover, our algorithm is optimal assuming the exponential-time hypothesis. Also, our algorithm can be extended to handle geometric intersection graphs of similarly sized fat objects without increasing the running time.
BibTeX - Entry
@InProceedings{an_et_al:LIPIcs.ISAAC.2021.47,
author = {An, Shinwoo and Oh, Eunjin},
title = {{Feedback Vertex Set on Geometric Intersection Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {47:1--47:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15480},
URN = {urn:nbn:de:0030-drops-154807},
doi = {10.4230/LIPIcs.ISAAC.2021.47},
annote = {Keywords: Feedback vertex set, intersection graphs, parameterized algorithm}
}
|
Keywords: |
|
Feedback vertex set, intersection graphs, parameterized algorithm |
|
Collection: |
|
32nd International Symposium on Algorithms and Computation (ISAAC 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
30.11.2021 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)