The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation (Q5145259): 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W2962677563 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:45, 19 March 2024
scientific article; zbMATH DE number 7298712
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation |
scientific article; zbMATH DE number 7298712 |
Statements
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation (English)
0 references
20 January 2021
0 references
centralized local computation
0 references
coloring
0 references
congested clique
0 references
massively parallel computation
0 references
