Faster algorithm for pathwidth one vertex deletion
From MaRDI portal
Recommendations
Cites work
- A quartic kernel for pathwidth-one vertex deletion
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- Faster FPT algorithm for 5-path vertex cover
- Faster parameterized algorithm for pumpkin vertex deletion set
- scientific article; zbMATH DE number 512967 (Why is no real title available?)
- Kernels for deletion to classes of acyclic digraphs
- Parameterized algorithm for 3-path vertex cover
- Polynomial kernels for deletion to classes of acyclic digraphs
Cited in
(7)- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- Faster parameterized algorithm for pumpkin vertex deletion set
- Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
- Smaller kernels for two vertex deletion problems
- Parameterized complexity of vertex splitting to pathwidth at most 1
- Improved kernelization and fixed-parameter algorithm for bipartite one-sided vertex explosion
- Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems
This page was built for publication: Faster algorithm for pathwidth one vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140570)
