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 this page instead for the normal view: Beyond bidimensionality: parameterized subexponential algorithms on directed graphs |
scientific article; zbMATH DE number 6244352
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
