A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletionopen access
- Authors
- Eiben, Eduard; Ganian, Robert; Kwon, O-joung
- Issue Date
- Nov-2018
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Keywords
- Distance-hereditary graphs; Fixed-parameter algorithms; Rank-width
- Citation
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v.97, pp.121 - 146
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Volume
- 97
- Start Page
- 121
- End Page
- 146
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191484
- DOI
- 10.1016/j.jcss.2018.05.005
- ISSN
- 0022-0000
- Abstract
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 자연과학대학 > 서울 수학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191484)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.