A 5k-vertex kernel for 3-path vertex cover

Cites Work

Minimum \(k\)-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
A fixed-parameter algorithm for the vertex cover \(P_3\) problem
On computing the minimum 3-path vertex cover and dissociation number of graphs
A generalization of Nemhauser and Trotter's local optimization theorem
Looking at the stars
Some results on graphs without long induced paths
On \({\mathcal F}\)-independence in graphs
Node-Deletion Problems on Bipartite Graphs
Title not available (Why is that?)
Kernels for Packing and Covering Problems
The complexity of restricted spanning tree problems
A parameterized perspective on packing paths of length two
An improved kernelization for \(P_{2}\)-packing
Kernelization for \(P_2\)-packing: a gerrymandering approach
A parameterized algorithm for bounded-degree vertex deletion
On a generalization of Nemhauser and Trotter's local optimization theorem
Independent packings in structured graphs
Fixed-parameter algorithms for Vertex Cover \(P_3\)
A measure and conquer approach for the parameterized bounded degree-one vertex deletion
A faster FPT algorithm for 3-path vertex cover
The complexity of dissociation set problems in graphs
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
Parameterized algorithm for 3-path vertex cover
Minimum cost flows in graphs with unit capacities

Cited In (2)

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A \(5k\)-vertex kernel for \(P_2\)-packing

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)