The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
