Year: 2013
Type: preprint
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 $\mathcal{O}(1.9602^n)$ computes the tree-depth of $G$. Our algorithm is based on combinatorial results revealing the structure of minimal rooted trees whose closures contain $G$.
Source: arXiv (Cornell University)
Institution: University of Bergen
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2951790645