Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bonnet, Edouard | - |
dc.contributor.author | Brettell, Nick | - |
dc.contributor.author | Kwon, O-joung | - |
dc.contributor.author | Marx, Daniel | - |
dc.date.accessioned | 2023-09-04T07:29:02Z | - |
dc.date.available | 2023-09-04T07:29:02Z | - |
dc.date.created | 2023-07-21 | - |
dc.date.issued | 2019-10 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189799 | - |
dc.description.abstract | It has long been known that Feedback Vertex Set can be solved in time 2 O-(w log w) n(O(1)) on n-vertex graphs of treewidth w, but it was only recently that this running time was improved to 2(O(w))n(O(1)), that is, to single-exponential parameterized by treewidth. We investigate which generalizations of Feedback Vertex Set can be solved in a similar running time. Formally, for a class P of graphs, the Bounded P-Block Vertex Deletion problem asks, given a graph G on n vertices and positive integers k and d, whether G contains a set S of at most k vertices such that each block of G -S has at most d vertices and is in P. Assuming that P is recognizable in polynomial time and satisfies a certain natural hereditary condition, we give a sharp characterization of when single-exponential parameterized algorithms are possible for fixed values of d: -,if P consists only of chordal graphs, then the problem can be solved in time 2(O(wd2))n(O(1)),,- if P contains a graph with an induced cycle of length l >= 4, then the problem is not solvable in time 2(o(w log w))n(O(1)) even for fixed d = l, unless the ETH fails.,We also study a similar problem, called Bounded P-Component Vertex Deletion, where the target graphs have connected components of small size rather than blocks of small size, and we present analogous results. For this problem, we also show that if d is part of the input and P contains all chordal graphs, then it cannot be solved in time f(w)n(o(w)) for some function f, unless the ETH fails. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O-joung | - |
dc.identifier.doi | 10.1007/s00453-019-00579-4 | - |
dc.identifier.scopusid | 2-s2.0-85065176239 | - |
dc.identifier.wosid | 000482896500004 | - |
dc.identifier.bibliographicCitation | ALGORITHMICA, v.81, no.SI 10, pp.3890 - 3935 | - |
dc.relation.isPartOf | ALGORITHMICA | - |
dc.citation.title | ALGORITHMICA | - |
dc.citation.volume | 81 | - |
dc.citation.number | SI 10 | - |
dc.citation.startPage | 3890 | - |
dc.citation.endPage | 3935 | - |
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.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | Bounded-treewidth graphs | - |
dc.subject.keywordPlus | Chordal graphs | - |
dc.subject.keywordPlus | Feedback vertex set | - |
dc.subject.keywordPlus | Feedback Vertex Set problems | - |
dc.subject.keywordPlus | Parameterized algorithm | - |
dc.subject.keywordPlus | Parameterized complexity | - |
dc.subject.keywordPlus | Tree-width | - |
dc.subject.keywordPlus | Vertex deletion problems | - |
dc.subject.keywordAuthor | Parameterized complexity | - |
dc.subject.keywordAuthor | Feedback Vertex Set | - |
dc.subject.keywordAuthor | Treewidth | - |
dc.subject.keywordAuthor | Chordal graph | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s00453-019-00579-4 | - |
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.