PACE Solver Description: tdULL

Authors Ruben Brokkelkamp , Raymond van Venetië , Mees de Vries, Jan Westerdiep

Thumbnail PDF


  • Filesize: 338 kB
  • 4 pages

Document Identifiers

Author Details

Ruben Brokkelkamp
  • Centrum Wiskunde & Informatica (CWI), The Netherlands
Raymond van Venetië
  • Korteweg-de Vries Institute, University of Amsterdam, The Netherlands
Mees de Vries
  • University of Amsterdam, The Netherlands
Jan Westerdiep
  • Korteweg-de Vries Institute, University of Amsterdam, The Netherlands

Cite AsGet BibTex

Ruben Brokkelkamp, Raymond van Venetië, Mees de Vries, and Jan Westerdiep. PACE Solver Description: tdULL. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 29:1-29:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Algorithm design techniques
  • Theory of computation → Graph algorithms analysis
  • PACE 2020
  • treedepth
  • treedepth decomposition
  • vertex ranking
  • minimal separators
  • branch and bound


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Anne Berry, Jean-Paul Bordat, and Olivier Cogis. Generating all the minimal separators of a graph. In Graph-Theoretic Concepts in Computer Science, pages 167-172, Berlin, Heidelberg, 1999. Springer Berlin Heidelberg. Google Scholar
  2. Ananth V. Iyer, H. Donald Ratliff, and G. Vijayan. Optimal node ranking of trees. Inf. Process. Lett., 28(5):225–229, August 1988. URL:
  3. Iztok Savnik. Index data structure for fast subset and superset queries. In International Conference on Availability, Reliability, and Security, pages 134-148. Springer, 2013. Google Scholar