On the Directed Degree-Preserving Spanning Tree Problem

DOI10.1007/978-3-642-11269-0_23zbMath1273.68182MaRDI QIDQ3656869

Saket Saurabh, Daniel Lokshtanov, Venkatesh Raman, Somnath Sikdar

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_23

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)