Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650)
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 6244352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond bidimensionality: parameterized subexponential algorithms on directed graphs |
scientific article; zbMATH DE number 6244352 |
Statements
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (English)
0 references
10 January 2014
0 references
parameterized algorithms
0 references
subexponential running time
0 references
directed graph
0 references
graph algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.99862802028656
0 references
0.81159907579422
0 references
0.8095333576202393
0 references
0.809045672416687
0 references
