PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem (Q6089682): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem | |||
| Property / DOI | |||
| Property / DOI: 10.4230/lipics.ipec.2020.33 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/13336/pdf/LIPIcs-IPEC-2020-33.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3115694774 / rank | |||
Normal rank | |||
| Property / title | |||
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem (English) | |||
| Property / title: PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem (English) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph Bisection with Pareto-Optimization / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.IPEC.2020.33 / rank | |||
Normal rank | |||
Latest revision as of 19:20, 30 December 2024
scientific article; zbMATH DE number 7764124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem |
scientific article; zbMATH DE number 7764124 |
Statements
13 November 2023
0 references
treedepth decomposition
0 references
elimination tree
0 references
separator
0 references
PACE 2020
0 references
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem (English)
0 references
