A 5k-vertex kernel for 3-path vertex cover
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- A faster FPT algorithm for 3-path vertex cover
- A fixed-parameter algorithm for the vertex cover P₃ problem
- A generalization of Nemhauser and Trotter's local optimization theorem
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- A parameterized algorithm for bounded-degree vertex deletion
- A parameterized perspective on packing paths of length two
- An improved kernelization for \(P_{2}\)-packing
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Independent packings in structured graphs
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Kernelization for \(P_2\)-packing: a gerrymandering approach
- Kernels for Packing and Covering Problems
- Looking at the stars
- Minimum \(k\)-path vertex cover
- Minimum cost flows in graphs with unit capacities
- NP-hard graph problems and boundary classes of graphs
- Node-Deletion Problems on Bipartite Graphs
- On \({\mathcal F}\)-independence in graphs
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- On the vertex \(k\)-path cover
- Parameterized algorithm for 3-path vertex cover
- Some results on graphs without long induced paths
- The complexity of dissociation set problems in graphs
- The complexity of restricted spanning tree problems
Cited in
(4)
This page was built for publication: A \(5k\)-vertex kernel for 3-path vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041673)
