Online coloring of bipartite graphs with and without advice (Q486981)
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 6387681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online coloring of bipartite graphs with and without advice |
scientific article; zbMATH DE number 6387681 |
Statements
Online coloring of bipartite graphs with and without advice (English)
0 references
19 January 2015
0 references
online coloring
0 references
lower bounds
0 references
advice complexity
0 references
bipartite graph
0 references
0.9986287355422974
0 references
0.9436438083648682
0 references
0.8874041438102722
0 references
0.8744162321090698
0 references
0.8571749925613403
0 references
