LIPIcs.IPEC.2020.33.pdf
- Filesize: 330 kB
- 4 pages
Document
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem
Author
Sylwester Swat 
-
Part of:
Volume:
15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-12-04
File
Document Identifiers
Author Details
Cite AsGet BibTex
Sylwester Swat. PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 33:1-33:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.IPEC.2020.33
https://doi.org/10.4230/LIPIcs.IPEC.2020.33
Abstract
This article briefly describes the most important algorithms and techniques used in the treedepth decomposition heuristic solver called "ExTREEm", submitted to the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2020) co-organized with the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph algorithms
Keywords
- Treedepth decomposition
- elimination tree
- separator
- PACE 2020
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Michael Hamann and Ben Strasser. Graph bisection with pareto-optimization. CoRR, abs/1504.03812, 2015. URL: http://arxiv.org/abs/1504.03812.