An FPT Algorithm for Tree Deletion Set

DOI10.1007/978-3-642-36065-7_27zbMath1379.68176OpenAlexW69424932MaRDI QIDQ4914457

Saket Saurabh, Ondřej Suchý, Venkatesh Raman

Publication date: 12 April 2013

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36065-7_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Parameterized complexity of finding connected induced subgraphs

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