PACE Solver Description: tdULL
Ruben Brokkelkamp, Raymond van Venetië, de Vries, Mees, Jan Westerdiep · UvA-DARE (University of Amsterdam) · 2020
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.