An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover}
From MaRDI portal
Publication:2659056
DOI10.1016/j.dam.2020.11.019OpenAlexW3113201831MaRDI QIDQ2659056
Publication date: 25 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03592
Related Items
Faster algorithm for pathwidth one vertex deletion ⋮ The k‐path vertex cover: General bounds and chordal graphs ⋮ Computing connected-\(k\)-subgraph cover with connectivity requirement ⋮ Faster parameterized algorithms for two vertex deletion problems
Cites Work
- Unnamed Item
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- A faster FPT algorithm for 3-path vertex cover
- An FPT algorithm for the vertex cover \(P_4\) problem
- The node-deletion problem for hereditary properties is NP-complete
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Parameterized algorithm for 3-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
