The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Link scheduling in polynomial time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph imperfection. I / rank | |||
Normal rank | |||
Latest revision as of 19:51, 2 July 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
