Faster algorithms and a smaller kernel for \textsc{Cliques or Trees Vertex Deletion}

DOI10.1016/J.IPL.2025.106570MaRDI QIDQ6970529zbMATH OpenFDO

Authors Dekel Tsur

Publication date 17 June 2025

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

Full work available at URL https://doi.org/10.1016/J.IPL.2025.106570

zbMATH Keywords

branching algorithmsgraph algorithmskernelizationparameterized complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Polynomial Kernel for Proper Interval Vertex Deletion
• Deletion to scattered graph classes. I: Case of finite number of graph classes
• Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
• Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time
• Improved analysis of highest-degree branching for feedback vertex set
• Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes

Cited in

(1)

• A polynomial kernel for deletion to the scattered class of cliques and trees

This page was built for publication: Faster algorithms and a smaller kernel for \textsc{Cliques or Trees Vertex Deletion}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970529)