Computing Tree-Depth Faster Than 2 n

DOI10.1007/978-3-319-03898-8_13zbMath1406.68039OpenAlexW2060423839WikidataQ60488415 ScholiaQ60488415MaRDI QIDQ2867079

Archontia C. Giannopoulou, Michał Pilipczuk, Fedor V. Fomin

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

Mathematics Subject Classification ID

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

Related Items (2)

Computing directed pathwidth in \(O(1.89^n)\) time ⋮ On vertex rankings of graphs and its relatives

This page was built for publication: Computing Tree-Depth Faster Than 2 n