A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996)
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: A 2O(k)poly(n) algorithm for the parameterized convex recoloring problem |
scientific article; zbMATH DE number 5686431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem |
scientific article; zbMATH DE number 5686431 |
Statements
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (English)
0 references
24 March 2010
0 references
graph algorithms
0 references
convex recoloring
0 references
parameterized complexity
0 references
0.94136393
0 references
0.9349701
0 references
0.9349701
0 references
0.9308735
0 references
0.9053837
0 references
0.90190315
0 references
0.90190315
0 references
0.89641833
0 references
0.8961261
0 references
0.8939521
0 references
