An FPT algorithm for Tree Deletion Set

DOI10.7155/jgaa.00308zbMath1276.05118OpenAlexW2105325360MaRDI QIDQ2865021

Venkatesh Raman, Saket Saurabh, Ondřej Suchý

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00308

zbMATH Keywords

undirected graphfixed-parameter algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) ⋮ Parameterised algorithms for deletion to classes of DAGs

This page was built for publication: An FPT algorithm for Tree Deletion Set