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.29
URN: urn:nbn:de:0030-drops-133326
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13332/
Brokkelkamp, Ruben ;
van Venetiƫ, Raymond ;
de Vries, Mees ;
Westerdiep, Jan
PACE Solver Description: tdULL
Abstract
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.
BibTeX - Entry
@InProceedings{brokkelkamp_et_al:LIPIcs:2020:13332,
author = {Ruben Brokkelkamp and Raymond van Veneti{\"e} and Mees de Vries and Jan Westerdiep},
title = {{PACE Solver Description: tdULL}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {29:1--29: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/13332},
URN = {urn:nbn:de:0030-drops-133326},
doi = {10.4230/LIPIcs.IPEC.2020.29},
annote = {Keywords: PACE 2020, treedepth, treedepth decomposition, vertex ranking, minimal separators, branch and bound}
}
Keywords: |
|
PACE 2020, treedepth, treedepth decomposition, vertex ranking, minimal separators, branch and bound |
Collection: |
|
15th International Symposium on Parameterized and Exact Computation (IPEC 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
04.12.2020 |
Supplementary Material: |
|
The source code can be found on https://github.com/mjdv/tdULL and https://doi.org/10.5281/zenodo.3881472 |