eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2016-08-19
34:1
34:14
10.4230/LIPIcs.MFCS.2016.34
article
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
Eiben, Eduard
Ganian, Robert
Kwon, O-joung
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex deletion to a plethora of graph classes has been systematically researched. Here we present the first single-exponential fixed-parameter algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertex deletion due to its connection to the graph parameter rank-width. We complement our result with matching asymptotic lower bounds based on the exponential time hypothesis.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol058-mfcs2016/LIPIcs.MFCS.2016.34/LIPIcs.MFCS.2016.34.pdf
distance-hereditary graphs
fixed-parameter algorithms
rank-width