Faster algorithm for pathwidth one vertex deletion

DOI10.1016/j.tcs.2022.04.001OpenAlexW4225773357MaRDI QIDQ2140570

Dekel Tsur

Publication date: 23 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.001

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}

Cites Work

• Unnamed Item
• Unnamed Item
• Kernels for deletion to classes of acyclic digraphs
• Polynomial kernels for deletion to classes of acyclic digraphs
• An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
• Parameterized algorithm for 3-path vertex cover
• Faster parameterized algorithm for pumpkin vertex deletion set
• An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover}
• A Quartic Kernel for Pathwidth-One Vertex Deletion

This page was built for publication: Faster algorithm for pathwidth one vertex deletion