On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q4925225)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6174143
| 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 6174143 |
Statements
On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles (English)
0 references
11 June 2013
0 references
0.9992637038230896
0 references
0.8536399602890015
0 references
0.8259198069572449
0 references
0.8127163052558899
0 references
0.8091330528259277
0 references
