Faster parameterized algorithms for minor containment (Q650942)
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: Faster parameterized algorithms for minor containment |
scientific article; zbMATH DE number 5987019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster parameterized algorithms for minor containment |
scientific article; zbMATH DE number 5987019 |
Statements
Faster parameterized algorithms for minor containment (English)
0 references
7 December 2011
0 references
graph minors
0 references
branchwidth
0 references
graph minor containment
0 references
parameterized complexity
0 references
dynamic programming
0 references
graphs on surfaces
0 references
0 references
0 references
1.0000001
0 references
0.90540904
0 references
0.8990168
0 references
0.8716497
0 references
0.8643519
0 references
0.8566613
0 references
0.8566613
0 references
0.85399354
0 references
