Faster parameterized algorithm for r-pseudoforest deletion
Author:
- 16 December 2024
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1028
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Fixed parameterized algorithms for generalized feedback vertex set problemsTheoretical Computer Science, 2023
- Faster deterministic algorithm for Cactus Vertex DeletionInformation Processing Letters, 2022
- An Improved Deterministic Parameterized Algorithm for Cactus Vertex DeletionTheory of Computing Systems, 2022
- An improved FPT algorithm for Almost Forest Deletion problemInformation Processing Letters, 2018
- A faster parameterized algorithm for Pseudoforest DeletionDiscrete Applied Mathematics, 2018
- Generalized Pseudoforest Deletion: Algorithms and Uniform KernelSIAM Journal on Discrete Mathematics, 2018
- Bivariate complexity analysis of Almost Forest DeletionTheoretical Computer Science, 2018
- Quick but Odd Growth of CactiAlgorithmica, 2017