On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081)
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: On the advice complexity of the online L(2,1)-coloring problem on paths and cycles |
scientific article; zbMATH DE number 6351422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles |
scientific article; zbMATH DE number 6351422 |
Statements
On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (English)
0 references
6 October 2014
0 references
online coloring
0 references
frequency assignment
0 references
advice complexity
0 references
randomized algorithms
0 references
0.9992637038230896
0 references
0.8565221428871155
0 references
0.8293208479881287
0 references
0.8151409029960632
0 references
0.8114449977874756
0 references
