Faster FPT algorithm for 5-path vertex cover
From MaRDI portal
Recommendations
Cites work
- A faster FPT algorithm for 3-path vertex cover
- A fixed-parameter algorithm for the vertex cover P₃ problem
- A shortcut to (sun)flowers: kernels in logarithmic space or linear time
- An FPT algorithm for the vertex cover \(P_4\) problem
- Exact algorithms for maximum independent set
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Exact exponential algorithms.
- 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
- Parameterized algorithm for 3-path vertex cover
- Parameterized algorithms
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Succinct data structures for nearest colored node in a tree
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(10)- Colored cut games
- Faster algorithm for pathwidth one vertex deletion
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
- Faster parameterized algorithms for two vertex deletion problems
- Computing connected-k-subgraph cover with connectivity requirement
- Generating Faster Algorithms for d-Path Vertex Cover
- On kernels for \(d\)-path vertex cover
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
- Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
- A faster FPT algorithm for 3-path vertex cover
This page was built for publication: Faster FPT algorithm for 5-path vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092393)
