A half-integral Erdős-Pósa theorem for directed odd cycles
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kawarabayashi, Ken-Ichi | - |
dc.contributor.author | Kreutzer, Stephan | - |
dc.contributor.author | Kwon, O-Joung | - |
dc.contributor.author | Xie, Qiqin | - |
dc.date.accessioned | 2023-09-26T09:42:25Z | - |
dc.date.available | 2023-09-26T09:42:25Z | - |
dc.date.created | 2023-09-18 | - |
dc.date.issued | 2023-01 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191251 | - |
dc.description.abstract | We prove that there exists a function f : ℕ → ℝ such that every directed graph G contains either k directed odd cycles where every vertex of G is contained in at most two of them, or a set of at most f(k) vertices meeting all directed odd cycles. We also give a polynomial-time algorithm for fixed k which outputs one of the two outcomes. Using this algorithmic result, we give a polynomial-time algorithm for fixed k to decide whether such k directed odd cycles exist, or there are no k vertex-disjoint directed odd cycles. This extends the half-integral Erdős-Pósa theorem for undirected odd cycles by Reed [Combinatorica 1999] to directed graphs. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | A half-integral Erdős-Pósa theorem for directed odd cycles | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O-Joung | - |
dc.identifier.doi | 10.1137/1.9781611977554.ch118 | - |
dc.identifier.scopusid | 2-s2.0-85170043688 | - |
dc.identifier.bibliographicCitation | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, v.2023-January, pp.3043 - 3062 | - |
dc.relation.isPartOf | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | - |
dc.citation.title | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | - |
dc.citation.volume | 2023-January | - |
dc.citation.startPage | 3043 | - |
dc.citation.endPage | 3062 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Polynomial approximation | - |
dc.subject.keywordPlus | Undirected graphs | - |
dc.subject.keywordPlus | Algorithmics | - |
dc.subject.keywordPlus | Graph G | - |
dc.subject.keywordPlus | Odd cycle | - |
dc.subject.keywordPlus | Polynomial-time algorithms | - |
dc.subject.keywordPlus | Vertex disjoint | - |
dc.subject.keywordPlus | Directed graphs | - |
dc.identifier.url | https://epubs.siam.org/doi/10.1137/1.9781611977554.ch118 | - |
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.