Faster parameterized algorithm for r-pseudoforest deletion

DOI10.1016/J.TCS.2024.115034MaRDI QIDQ6664062zbMATH OpenFDO

Authors Dekel Tsur

Publication date 16 January 2025

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

Full work available at URL https://doi.org/10.1016/J.TCS.2024.115034

zbMATH Keywords

branching algorithmsgraph algorithmsparameterized complexity

Mathematics Subject Classification ID

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

Recommendations

• A faster parameterized algorithm for pseudoforest deletion
• A faster parameterized algorithm for pseudoforest deletion
• Fixed parameterized algorithms for generalized feedback vertex set problems
• Generalized pseudoforest deletion: algorithms and uniform kernel
• An approximation algorithm for the \(l\)-pseudoforest deletion problem

Cites work

• A faster parameterized algorithm for pseudoforest deletion
• An improved deterministic parameterized algorithm for cactus vertex deletion
• An improved FPT algorithm for almost forest deletion problem
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Faster deterministic algorithm for cactus vertex deletion
• Fixed parameterized algorithms for generalized feedback vertex set problems
• Generalized pseudoforest deletion: algorithms and uniform kernel
• Generalized pseudoforest deletion: algorithms and uniform kernel
• Improved FPT Algorithms for Deletion to Forest-Like Structures.
• Parameterized algorithms
• Parameterized vertex deletion problems for hereditary graph classes with a block property
• Quick but odd growth of cacti

Cited in

(1)

• Fixed parameterized algorithms for generalized feedback vertex set problems

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)