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

DOI10.4230/LIPICS.IPEC.2020.33OpenAlexW3115694774MaRDI QIDQ6089682FDOQ6089682

Sylwester Swat

Publication date: 13 November 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/13336/pdf/LIPIcs-IPEC-2020-33.pdf/

zbMATH Keywords

separatorelimination treetreedepth decompositionPACE 2020

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Graph Bisection with Pareto-Optimization

Cited In (1)

• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

This page was built for publication: PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089682)