Faster parameterized algorithms for two vertex deletion problems
From MaRDI portal
Publication:2699960
DOI10.1016/j.tcs.2022.10.044OpenAlexW4308979214MaRDI QIDQ2699960
Publication date: 20 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.044
Cites Work
- Unnamed Item
- A fast branching algorithm for cluster vertex deletion
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- On the computational complexity of vertex integrity and component order connectivity
- A faster FPT algorithm for 3-path vertex cover
- An FPT algorithm for the vertex cover \(P_4\) problem
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Faster parameterized algorithm for cluster vertex deletion
- Iterative compression and exact algorithms
- Parameterized algorithm for 3-path vertex cover
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover}
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
- Parameterized Algorithms for Hitting Set: The Weighted Case
This page was built for publication: Faster parameterized algorithms for two vertex deletion problems
