2026-08-10T11:59:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6448 2024-03-06T10:38:18Z ddc:004 open_access

A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard Ganian, Robert Kwon, O-joung distance-hereditary graphs fixed-parameter algorithms rank-width 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Eduard Eiben and Robert Ganian and O-joung Kwon 2016 Is Part Of LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2016.34 urn:nbn:de:0030-drops-64483 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.34 eng https://creativecommons.org/licenses/by/3.0/legalcode