Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
From MaRDI portal
Publication:5146829
DOI10.1137/1.9781611975994.58OpenAlexW3002754118MaRDI QIDQ5146829
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.12298
Related Items (13)
Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ An improved deterministic parameterized algorithm for cactus vertex deletion ⋮ Parameterized complexity of fair feedback vertex set problem ⋮ Odd cycle transversal in mixed graphs ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Faster algorithms for cycle hitting problems on disk graphs ⋮ Fixed parameterized algorithms for generalized feedback vertex set problems ⋮ Improved FPT Algorithms for Deletion to Forest-Like Structures. ⋮ Improved analysis of highest-degree branching for feedback vertex set ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set ⋮ Faster deterministic algorithm for cactus vertex deletion ⋮ FPT algorithms for generalized feedback vertex set problems
This page was built for publication: Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
