FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
DOI10.1007/978-3-319-59605-1_19zbMath1489.68197OpenAlexW2619616241MaRDI QIDQ4632216
Venkatesh Raman, Diptapriyo Majumdar
Publication date: 26 April 2019
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_19
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- A fast branching algorithm for cluster vertex deletion
- On feedback vertex set: new measure and new structures
- Improved algorithms for feedback vertex set problems
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- Faster deterministic \textsc{Feedback Vertex Set}
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Vertex Cover: Further Observations and Further Improvements
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Structural Parameterizations of Feedback Vertex Set
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Faster Parameterized Algorithms Using Linear Programming
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
