Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of network synchronization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Las Vegas RNC algorithm for maximum matching / rank | |||
Normal rank | |||
Latest revision as of 18:46, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel \((\Delta +1)\)-coloring of constant-degree graphs |
scientific article |
Statements
Parallel \((\Delta +1)\)-coloring of constant-degree graphs (English)
0 references
1987
0 references
graph coloring
0 references
parallel algorithms
0 references
maximal independent set
0 references
EREW PRAM
0 references
complexity bounds
0 references
