On kernels for d-path vertex cover
From MaRDI portal
Cites work
- A 4k^2 kernel for feedback vertex set
- A kernel of order 2k-c k for vertex cover
- A primal-dual approximation algorithm for the vertex cover P^3 problem
- A shortcut to (sun)flowers: kernels in logarithmic space or linear time
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Exact algorithms for maximum independent set
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Fast witness extraction using a decision oracle
- Faster deterministic parameterized algorithm for k-path
- Faster FPT algorithm for 5-path vertex cover
- Generating Faster Algorithms for d-Path Vertex Cover
- Hitting forbidden minors: approximation and kernelization
- Improved upper bounds for vertex cover
- Iterative compression and exact algorithms
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Minimum \(k\)-path vertex cover
- Mixing Color Coding-Related Techniques
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
- Parameterized algorithmics for d-HITTING SET
- Parameterized algorithms
- Partitioning a graph into small pieces with applications to path transversal
- Paths, Trees, and Flowers
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- The node-deletion problem for hereditary properties is NP-complete
This page was built for publication: On kernels for \(d\)-path vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564612)
