We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implementation was submitted to the exact track of PACE 2020. tdULL is a branch and bound algorithm branching on inclusion-minimal separators.

PACE 2020, Treedepth, Treedepth decomposition, Vertex ranking, Minimal separators, Branch and bound
doi.org/10.4230/LIPIcs.IPEC.2020.29
Parameterized Algorithms and Computational Experiments
Networks and Optimization

Brokkelkamp, K.R, van Venetië, R., de Vries, M.J, & Westerdiep, J. (2020). PACE Solver Description: tdULL. In 15th International Symposium on Parameterized and Exact Computation. doi:10.4230/LIPIcs.IPEC.2020.29