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 the normal view instead:
scientific article; zbMATH DE number 6094038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9821584820747375
0 references
0.8568457365036011
0 references
0.846219003200531
0 references
0.8223500847816467
0 references
0.8119596242904663
0 references
