The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556)
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: The performance of an upper bound on the fractional chromatic number of weighted graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The performance of an upper bound on the fractional chromatic number of weighted graphs |
scientific article |
Statements
The performance of an upper bound on the fractional chromatic number of weighted graphs (English)
0 references
5 May 2010
0 references
fractional chromatic number
0 references
upper bound
0 references
weighted graph
0 references
greedy coloring algorithm
0 references
worst-case performance
0 references
distributed systems
0 references
0.7625043988227844
0 references
0.7446058392524719
0 references
0.7433398962020874
0 references
0.7413567304611206
0 references
