Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(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.1016/0020-0190(87)90169-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2009524061 / rank | |||
Normal rank | |||
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