A polynomial kernel for Distance-Hereditary Vertex Deletion
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Eun Jung | - |
dc.contributor.author | Kwon, O jung | - |
dc.date.accessioned | 2023-09-04T07:15:30Z | - |
dc.date.available | 2023-09-04T07:15:30Z | - |
dc.date.created | 2023-07-21 | - |
dc.date.issued | 2021-07 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189706 | - |
dc.description.abstract | A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the original graph. The DISTANCE-HEREDITARY VERTEX DELETION problem asks, given a graph G on n vertices and an integer k, whether there is a set S of at most k vertices in G such that G - S is distance-hereditary. This problem is important due to its connection to the graph parameter rank-width because distance-hereditary graphs are exactly the graphs of rank-width at most 1. Eiben, Ganian, and Kwon (JCSS' 18) proved that DISTANCE-HEREDITARY VERTEX DELETION can be solved in time 2(O(k)) n(O(1)), and asked whether it admits a polynomial kernelization. We show that this problem admits a polynomial kernel, answering this question positively. For this, we use a similar idea for obtaining an approximate solution for CHORDAL VERTEX DELETION due to Jansen and Pilipczuk (SIDMA' 18) to obtain an approximate solution with O(k(3) log n + k(2) log(2) n) vertices when the problem is a YEs-instance, and we exploit the structure of split decompositions of distance-hereditary graphs to reduce the total size. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | A polynomial kernel for Distance-Hereditary Vertex Deletion | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O jung | - |
dc.identifier.doi | 10.1007/s00453-021-00820-z | - |
dc.identifier.scopusid | 2-s2.0-85103290163 | - |
dc.identifier.wosid | 000631750000001 | - |
dc.identifier.bibliographicCitation | ALGORITHMICA, v.83, no.7, pp.2096 - 2141 | - |
dc.relation.isPartOf | ALGORITHMICA | - |
dc.citation.title | ALGORITHMICA | - |
dc.citation.volume | 83 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 2096 | - |
dc.citation.endPage | 2141 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer ScienceMathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software EngineeringMathematics, Applied | - |
dc.subject.keywordAuthor | Parameterized complexity | - |
dc.subject.keywordAuthor | Polynomial kernel | - |
dc.subject.keywordAuthor | Distance-hereditary graph | - |
dc.subject.keywordAuthor | Rank-width | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s00453-021-00820-z | - |
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.