On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704)
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: On the algorithmic effectiveness of digraph decompositions and complexity measures |
scientific article; zbMATH DE number 6094038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic effectiveness of digraph decompositions and complexity measures |
scientific article; zbMATH DE number 6094038 |
Statements
On the algorithmic effectiveness of digraph decompositions and complexity measures (English)
0 references
16 October 2012
0 references
treewidth
0 references
digraph decompositions
0 references
parameterized complexity
0 references
