Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748)
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: Subexponential parameterized algorithms for graphs of polynomial growth |
scientific article; zbMATH DE number 7205037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential parameterized algorithms for graphs of polynomial growth |
scientific article; zbMATH DE number 7205037 |
Statements
27 May 2020
0 references
polynomial growth
0 references
subexponential algorithm
0 references
low treewidth pattern covering
0 references
0 references
0 references
0 references
0 references
Subexponential parameterized algorithms for graphs of polynomial growth (English)
0 references
0.9131372
0 references
0.9044421
0 references
0 references
0.90387625
0 references
0.8983485
0 references
0.8983485
0 references
0.89803135
0 references
0.8966494
0 references
