On the complexity of distributed graph coloring with local minimality constraints (Q3057099)
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: On the complexity of distributed graph coloring with local minimality constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of distributed graph coloring with local minimality constraints |
scientific article |
Statements
On the complexity of distributed graph coloring with local minimality constraints (English)
0 references
24 November 2010
0 references
distributed computing
0 references
graph coloring
0 references
greedy algorithm
0 references
randomization
0 references
0 references
