A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-86838-3_13 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3201541230 / rank | |||
Normal rank | |||
Revision as of 02:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach to the treedepth decomposition problem for large graphs |
scientific article |
Statements
A heuristic approach to the treedepth decomposition problem for large graphs (English)
0 references
8 June 2022
0 references
treedepth decomposition
0 references
elimination tree
0 references
separator
0 references
