PACE Solver Description: Tree Depth with FlowCutter
Ben Strasser · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2020
We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of the challenge consists of computing an elimination tree of small height for a given graph. At its core our submission uses a nested dissection approach, with FlowCutter as graph bisection algorithm.