License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2020.34
URN: urn:nbn:de:0030-drops-133371
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13337/
Trimble, James
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth
Abstract
This note introduces Bute-Plus, an exact solver for the treedepth problem. The core of the solver is a positive-instance driven dynamic program that constructs an elimination tree of minimum depth in a bottom-up fashion. Three features greatly improve the algorithm’s run time. The first of these is a specialised trie data structure. The second is a domination rule. The third is a heuristic presolve step can quickly find a treedepth decomposition of optimal depth for many instances.
BibTeX - Entry
@InProceedings{trimble:LIPIcs:2020:13337,
author = {James Trimble},
title = {{PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {34:1--34:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Yixin Cao and Marcin Pilipczuk},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13337},
URN = {urn:nbn:de:0030-drops-133371},
doi = {10.4230/LIPIcs.IPEC.2020.34},
annote = {Keywords: Treedepth, Elimination Tree, Graph Algorithms}
}
