Abstract
In the Co-path Packing (resp., Co-path/cycle Packing) problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph which is a collection of induced paths (resp., induced paths and cycles). In this paper we give deterministic \(O^*(3^k)\)-time algorithms for Co-path Packing and Co-path/cycle Packing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Agrawal A, Saurabh S, Sharma R, Zehavi M (2018a) Kernels for deletion to classes of acyclic digraphs. J Comput Syst Sci 92:9–21
Agrawal A, Saurabh S, Sharma R, Zehavi M (2018b) Parameterised algorithms for deletion to classes of DAGs. Theory Comput Syst 1–30
Aoike Y, Gima T, Hanaka T, Kiyomi M, Kobayashi Y, Kobayashi Y, Kurita K, Otachi Y (2020) An improved deterministic parameterized algorithm for cactus vertex deletion. arXiv preprint arXiv:2012.04910
Betzler N, Bredereck R, Niedermeier R, Uhlmann J (2012) On bounded-degree vertex deletion parameterized by treewidth. Discret Appl Math 160(1–2):53–60
Bonnet É, Brettell N, Kwon O-j, Marx D (2016) Parameterized vertex deletion problems for hereditary graph classes with a block property. In: Proceedings of 42nd workshop on graph-theoretic concepts in computer science (WG), pp 233–244
Červenỳ R, Suchỳ O (2021) Generating faster algorithms for d-path vertex cover. arXiv preprint arXiv:2111.05896
Chang M-S, Chen L-H, Hung L-J, Rossmanith P, Su P-C (2016) Fixed-parameter algorithms for vertex cover \(P_3\). Discrete Optim 19:12–22
Chen Z-Z, Fellows M, Fu B, Jiang H, Liu Y, Wang L, Zhu B (2010) A linear kernel for co-path/cycle packing. In: Proceedings of 6th conference on algorithmic applications in management (AAIM), pp 90–102
Cygan M, Pilipczuk M, Pilipczuk M, Wojtaszczyk JO (2012) An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion. Algorithmica 64(1):170–188
Fellows MR, Guo J, Moser H, Niedermeier R (2011) A generalization of Nemhauser and Trotter’s local optimization theorem. J Comput Syst Sci 77(6):1141–1158
Feng Q, Wang J, Li S, Chen J (2015) Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems. J Comb Optim 29(1):125–140
Ganian R, Klute F, Ordyniak S (2021) On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica 83(1):297–336
Katrenič J (2016) A faster FPT algorithm for 3-path vertex cover. Inf Process Lett 116(4):273–278
Kolay S, Lokshtanov D, Panolan F, Saurabh S (2017) Quick but odd growth of cacti. Algorithmica 79(1):271–290
Komusiewicz C, Hüffner F, Moser H, Niedermeier R (2009) Isolation concepts for efficiently enumerating dense subgraphs. Theoret Comput Sci 410(38–40):3640–3654
Mnich M, van Leeuwen EJ (2017) Polynomial kernels for deletion to classes of acyclic digraphs. Discrete Optim 25:48–76
Nishimura N, Ragde P, Thilikos DM (2005) Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Appl Math 152(1–3):229–245
Philip G, Raman V, Villanger Y (2010) A quartic kernel for pathwidth-one vertex deletion. In: Proceedings of 36th international workshop on graph-theoretic concepts in computer science (WG), pp 196–207
Seidman SB, Foster BL (1978) A graph-theoretic generalization of the clique concept. J Math Sociol 6(1):139–154
Tsur D (2019) Faster parameterized algorithm for pumpkin vertex deletion set. Inf Process Lett 147:74–76
Tsur D (2019) Parameterized algorithm for 3-path vertex cover. Theoret Comput Sci 783:1–8
Tsur D (2022) Faster algorithm for pathwidth one vertex deletion. Theoret Comput Sci 921:63–74
Tu J (2015) A fixed-parameter algorithm for the vertex cover \(P_3\) problem. Inf Process Lett 115(2):96–99
Wu BY (2015) A measure and conquer approach for the parameterized bounded degree-one vertex deletion. In: Proceedings of 21st international computing and combinatorics conference (COCOON), pp 469–480
Xiao M (2016) A parameterized algorithm for bounded-degree vertex deletion. In: Proceedings of 22nd computing and combinatorics conference (COCOON), pp 79–91
Xiao M (2017) On a generalization of Nemhauser and Trotter’s local optimization theorem. J Comput Syst Sci 84:97–106
Xiao M, Kou S (2017) Kernelization and parameterized algorithms for 3-path vertex cover. In: Proceedings of 14th international conference on theory and applications of models of computation (TAMC), pp 654–668
Funding
The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Tsur, D. Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing. J Comb Optim 44, 3701–3710 (2022). https://doi.org/10.1007/s10878-022-00917-3
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00917-3