An Algorithm for the Exact Treedepth Problem
Abstract
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to the optimal treedepth decomposition problem. Our algorithm makes use of two cheaply-computed lower bound functions to prune the search tree, along with symmetry-breaking and domination rules. We present an empirical study showing that the algorithm outperforms the current state-of-the-art solver (which is based on a SAT encoding) by orders of magnitude on a range of graph classes.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2020
- DOI:
- 10.48550/arXiv.2004.08959
- arXiv:
- arXiv:2004.08959
- Bibcode:
- 2020arXiv200408959T
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Computer Science - Data Structures and Algorithms;
- G.2.2
- E-Print:
- 14 pages, 6 figures, 2 tables. This is an extended version of a paper to appear in the proceedings of SEA 2020. The arXiv version is the conference version plus Appendix A (a correctness proof)