A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Eiben, Eduard | - |
dc.contributor.author | Ganian, Robert | - |
dc.contributor.author | Kwon, O-joung | - |
dc.date.accessioned | 2023-09-26T10:14:30Z | - |
dc.date.available | 2023-09-26T10:14:30Z | - |
dc.date.created | 2023-07-07 | - |
dc.date.issued | 2018-11 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191484 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O-joung | - |
dc.identifier.doi | 10.1016/j.jcss.2018.05.005 | - |
dc.identifier.scopusid | 2-s2.0-85049532962 | - |
dc.identifier.wosid | 000441371400009 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v.97, pp.121 - 146 | - |
dc.relation.isPartOf | JOURNAL OF COMPUTER AND SYSTEM SCIENCES | - |
dc.citation.title | JOURNAL OF COMPUTER AND SYSTEM SCIENCES | - |
dc.citation.volume | 97 | - |
dc.citation.startPage | 121 | - |
dc.citation.endPage | 146 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | POLYNOMIAL-TIME | - |
dc.subject.keywordPlus | CLIQUE-WIDTH | - |
dc.subject.keywordPlus | SPLIT DECOMPOSITION | - |
dc.subject.keywordPlus | GRAPH RECOGNITION | - |
dc.subject.keywordPlus | RANK-WIDTH | - |
dc.subject.keywordPlus | COMPLEXITY | - |
dc.subject.keywordPlus | KERNEL | - |
dc.subject.keywordPlus | MINORS | - |
dc.subject.keywordPlus | TREES | - |
dc.subject.keywordPlus | COVER | - |
dc.subject.keywordAuthor | Distance-hereditary graphs | - |
dc.subject.keywordAuthor | Fixed-parameter algorithms | - |
dc.subject.keywordAuthor | Rank-width | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0022000018306044?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.