On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures (Q3596720)
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 5500013
| 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 5500013 |
Statements
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures (English)
0 references
29 January 2009
0 references
treewidth
0 references
digraph decompositions
0 references
parameterized complexity
0 references
0.9821584820747375
0 references
0.8556147813796997
0 references
0.8419086337089539
0 references
0.8188037872314453
0 references
0.805302619934082
0 references
