Document Open Access Logo

PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem

Author Sylwester Swat

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2020.33.pdf
  • Filesize: 330 kB
  • 4 pages

Document Identifiers

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)
    0
    PDF Downloads
    0
    Metadata Views

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).

Cite As Get 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

Author Details

Sylwester Swat
  • Institute of Computing Science, Poznan University of Technology, Poland

Supplementary Materials

References

  1. Michael Hamann and Ben Strasser. Graph bisection with pareto-optimization. CoRR, abs/1504.03812, 2015. URL: http://arxiv.org/abs/1504.03812.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact