Mim-Width II. The Feedback Vertex Set Problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwon, O jung | - |
dc.contributor.author | Jaffke, Lars | - |
dc.contributor.author | Telle, Jan Arne | - |
dc.date.accessioned | 2023-08-16T08:12:06Z | - |
dc.date.available | 2023-08-16T08:12:06Z | - |
dc.date.created | 2023-07-19 | - |
dc.date.issued | 2020-01 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189311 | - |
dc.description.abstract | We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width w, we give an nO(w)-time algorithm that solves Feedback Vertex Set. This provides a unified polynomial-time algorithm for many well-known classes, such as Interval graphs, Permutation graphs, and Leaf power graphs (given a leaf root), and furthermore, it gives the first polynomial-time algorithms for other classes of bounded mim-width, such as Circular Permutation and Circular k-Trapezoid graphs (given a circular k-trapezoid model) for fixed k. We complement our result by showing that Feedback Vertex Set is W[1]-hard when parameterized by w and the hardness holds even when a linear branch decomposition of mim-width w is given. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Mim-Width II. The Feedback Vertex Set Problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O jung | - |
dc.identifier.doi | 10.1007/s00453-019-00607-3 | - |
dc.identifier.scopusid | 2-s2.0-85068974643 | - |
dc.identifier.wosid | 000511723800007 | - |
dc.identifier.bibliographicCitation | ALGORITHMICA, v.82, no.1, pp.118 - 145 | - |
dc.relation.isPartOf | ALGORITHMICA | - |
dc.citation.title | ALGORITHMICA | - |
dc.citation.volume | 82 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 118 | - |
dc.citation.endPage | 145 | - |
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.identifier.url | https://link.springer.com/article/10.1007/s00453-019-00607-3 | - |
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.