A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00106818" target="_blank" >RIV/00216224:14330/18:00106818 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jcss.2018.05.005" target="_blank" >http://dx.doi.org/10.1016/j.jcss.2018.05.005</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2018.05.005" target="_blank" >10.1016/j.jcss.2018.05.005</a>
Alternative languages
Result language
angličtina
Original language name
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Original language description
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 tractable 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. As an application of our algorithm, we show that a vertex deletion set to distance-hereditary graphs can be used as a parameter which allows single-exponential fixed-parameter tractable algorithms for classical NP-hard problems.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Computer and System Sciences
ISSN
0022-0000
e-ISSN
—
Volume of the periodical
97
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
26
Pages from-to
121-146
UT code for WoS article
000441371400009
EID of the result in the Scopus database
2-s2.0-85049532962