An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (Q3985808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 27803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph |
scientific article; zbMATH DE number 27803 |
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
0.8551968336105347
0 references
0.8420132398605347
0 references
0.8395870923995972
0 references
