On the complexity of distributed graph coloring (Q5177259): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1146381.1146387 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109368894 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:56, 20 March 2024
scientific article; zbMATH DE number 6413482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of distributed graph coloring |
scientific article; zbMATH DE number 6413482 |
Statements
On the complexity of distributed graph coloring (English)
0 references
10 March 2015
0 references
chromatic number
0 references
distributed algorithms
0 references
graph coloring
0 references
locality
0 references
neighborhood graph
0 references
symmetry breaking
0 references
