论文标题
Sallow：TreeDeppth分解的启发式算法
Sallow: a heuristic algorithm for treedepth decompositions
论文作者
论文摘要
我们描述了用于计算TreeDeppth分解的启发式算法，该算法提交了2020年PACE挑战。它依赖于各种贪婪的算法计算消除顺序，以及使用Hamann＆Strasser的2016 Flow Cutter算法从2016年Flow Cratch重新实现获得的平衡切割方法的分歧和征服方法[ACM JEA 2018]。
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the PACE 2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide & Conquer approach on balanced cuts obtained using a from-scratch reimplementation of the 2016 FlowCutter algorithm by Hamann & Strasser [ACM JEA 2018].
