Faster deterministic algorithm for cactus vertex deletion

DOI10.1016/J.IPL.2022.106317OpenAlexW4294927212WikidataQ114167060 ScholiaQ114167060MaRDI QIDQ2094388

Dekel Tsur

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106317

zbMATH Keywords

algorithmsgraph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• A faster parameterized algorithm for pseudoforest deletion
• An improved FPT algorithm for almost forest deletion problem
• An improved deterministic parameterized algorithm for cactus vertex deletion
• Quick but odd growth of cacti
• Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Parameterized Algorithms for Even Cycle Transversal
• Parameterized Algorithms
• Improved FPT Algorithms for Deletion to Forest-Like Structures.

This page was built for publication: Faster deterministic algorithm for cactus vertex deletion