eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-11-30
47:1
47:12
10.4230/LIPIcs.ISAAC.2021.47
article
Feedback Vertex Set on Geometric Intersection Graphs
An, Shinwoo
1
Oh, Eunjin
1
POSTECH, Pohang, South Korea
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.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.47/LIPIcs.ISAAC.2021.47.pdf
Feedback vertex set
intersection graphs
parameterized algorithm