Abstract
A connected graph has tree-depth at most k if it is a subgraph of the closure of a rooted tree whose height is at most k. We give an algorithm which for a given n-vertex graph G, in time O*(1.9602n) computes the tree-depth of G. Our algorithm is based on combinatorial results revealing the structure of minimal rooted trees whose closures contain G. © 2013 Springer International Publishing.
Cite
CITATION STYLE
Fomin, F. V., Giannopoulou, A. C., & Pilipczuk, M. (2013). Computing tree-depth faster than 2n. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8246 LNCS, pp. 137–149). https://doi.org/10.1007/978-3-319-03898-8_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
