Skip to Main content Skip to Navigation
Reports

DAIA: a decompose and improve algorithm for treedepth decomposition

Abstract : DAIA is a two-phases heuristic algorithm that searches for good treedepth decompositions of graphs. First it builds a treedepth decomposition partitionning recursively the vertices. Then it modifies the resulting tree in order to reduce its height.
Document type :
Reports
Complete list of metadatas

https://hal-amu.archives-ouvertes.fr/hal-03133843
Contributor : Stéphane Grandcolas <>
Submitted on : Sunday, February 7, 2021 - 1:38:17 PM
Last modification on : Tuesday, February 16, 2021 - 3:23:03 AM

File

daia.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Stéphane Grandcolas. DAIA: a decompose and improve algorithm for treedepth decomposition. [Research Report] Aix-Marseille Université (AMU); LIS. 2020. ⟨hal-03133843⟩

Share

Metrics

Record views

25

Files downloads

5