Sallow: a heuristic algorithm for treedepth decompositions
Data Structures and Algorithms
2020-10-01 v4
Abstract
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].
Cite
@article{arxiv.2006.07050,
title = {Sallow: a heuristic algorithm for treedepth decompositions},
author = {Marcin Wrochna},
journal= {arXiv preprint arXiv:2006.07050},
year = {2020}
}
Comments
A shorter version will appear in proceedings of IPEC 2020