Approximation algorithms for digraph width parameters (Q476883)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for digraph width parameters |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for digraph width parameters |
scientific article |
Statements
Approximation algorithms for digraph width parameters (English)
0 references
2 December 2014
0 references
approximation algorithms
0 references
arboreal decomposition
0 references
directed treewidth
0 references
DAG-decomposition
0 references
DAG-width
0 references
directed path decomposition
0 references
directed pathwidth
0 references
Kelly decomposition
0 references
Kelly-width
0 references
directed vertex separators
0 references
0 references
0 references
0.8369734287261963
0 references
0.8283509016036987
0 references
0.8223500847816467
0 references
0.8197628855705261
0 references
0.8188037872314453
0 references
