Faster parameterized algorithm for \(r\)-pseudoforest deletion

DOI10.1016/j.tcs.2024.115034MaRDI QIDQ6664062

Dekel Tsur

Publication date: 16 January 2025

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

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
• Faster deterministic algorithm for cactus vertex deletion
• An improved deterministic parameterized algorithm for cactus vertex deletion
• Quick but odd growth of cacti
• Fixed parameterized algorithms for generalized feedback vertex set problems
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Parameterized Algorithms
• Improved FPT Algorithms for Deletion to Forest-Like Structures.

This page was built for publication: Faster parameterized algorithm for \(r\)-pseudoforest deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6664062)