PACE solver description: tdULL

Open Access
Authors
Publication date 12-2020
Host editors
  • Y. Cao
  • M. Pilipczuk
Book title 15th International Symposium on Parameterized and Exact Computation
Book subtitle IPEC 2020, December 14–18, 2020, Hong Kong, China (Virtual Conference)
ISBN (electronic)
  • 9783959771726
Series Leibniz International Proceedings in Informatics
Event 15th International Symposium on Parameterized and Exact Computation, IPEC 2020
Article number 29
Number of pages 4
Publisher Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Organisations
  • Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
  • Faculty of Science (FNWI) - Institute of Interdisciplinary Studies (ISS)
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.
Document type Conference contribution
Language English
Published at https://doi.org/10.4230/LIPIcs.IPEC.2020.29
Other links https://www.scopus.com/pages/publications/85100366699
Downloads
PACE Solver Description - tdULL (Final published version)
Permalink to this page
Back