Computing Tree-Depth Faster Than 2 n
From MaRDI portal
Publication:2867079
DOI10.1007/978-3-319-03898-8_13zbMath1406.68039WikidataQ60488415 ScholiaQ60488415MaRDI QIDQ2867079
Fedor V. Fomin, Michał Pilipczuk, Archontia C. Giannopoulou
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_13
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity