An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (Q3985808): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:57, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph |
scientific article |
Statements
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (English)
0 references
27 June 1992
0 references
parallel randomized algorithm
0 references
connected components
0 references
CRCW
0 references
