Tight bounds for online coloring of basic graph classes (Q5111690)
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: Tight bounds for online coloring of basic graph classes |
scientific article; zbMATH DE number 7204985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for online coloring of basic graph classes |
scientific article; zbMATH DE number 7204985 |
Statements
27 May 2020
0 references
graph coloring
0 references
online algorithms
0 references
lower bounds
0 references
randomization
0 references
Tight Bounds for Online Coloring of Basic Graph Classes (English)
0 references
0.9993658661842346
0 references
0.8825846910476685
0 references
0.8705387115478516
0 references
0.8698301315307617
0 references
