On the complexity of distributed graph coloring with local minimality constraints (Q3057099): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q62048702, #quickstatements; #temporary_batch_1715314706700 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4229960859 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62048702 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:18, 10 May 2024
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
