Approximation algorithms for digraph width parameters (Q476883): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.10.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.10.009 / rank | |||
Normal rank | |||
Revision as of 02:24, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
