A \(5k\)-vertex kernel for 3-path vertex cover
From MaRDI portal
Publication:6041673
DOI10.1016/j.tcs.2023.113872MaRDI QIDQ6041673
Publication date: 12 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- On a generalization of Nemhauser and Trotter's local optimization theorem
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A generalization of Nemhauser and Trotter's local optimization theorem
- Kernelization for \(P_2\)-packing: a gerrymandering approach
- Looking at the stars
- A parameterized perspective on packing paths of length two
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
- A faster FPT algorithm for 3-path vertex cover
- An improved kernelization for \(P_{2}\)-packing
- Some results on graphs without long induced paths
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Minimum \(k\)-path vertex cover
- The complexity of dissociation set problems in graphs
- Parameterized algorithm for 3-path vertex cover
- On the vertex \(k\)-path cover
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- NP-hard graph problems and boundary classes of graphs
- Independent packings in structured graphs
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion
- Kernels for Packing and Covering Problems
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
- On F-independence in graphs
- Node-Deletion Problems on Bipartite Graphs
- The complexity of restricted spanning tree problems
This page was built for publication: A \(5k\)-vertex kernel for 3-path vertex cover
