Faster parameterized algorithm for pumpkin vertex deletion set

DOI10.1016/j.ipl.2019.03.009zbMath1473.05295arXiv1901.02491OpenAlexW2963617229MaRDI QIDQ2414055

Dekel Tsur

Publication date: 10 May 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.02491

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Combining clickstream analyses and graph-modeled data clustering for identifying common response processes ⋮ Faster algorithm for pathwidth one vertex deletion ⋮ A tight approximation algorithm for the cluster vertex deletion problem ⋮ Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}

Cites Work

• Kernels for deletion to classes of acyclic digraphs
• Polynomial kernels for deletion to classes of acyclic digraphs
• Parameterized Algorithms

This page was built for publication: Faster parameterized algorithm for pumpkin vertex deletion set