An O(logn) parallel connectivity algorithm (Q3957960)
From MaRDI portal
!
WARNING
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 3778761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(logn) parallel connectivity algorithm |
scientific article; zbMATH DE number 3778761 |
Statements
An O(logn) parallel connectivity algorithm (English)
0 references
1982
0 references
connected components of an undirected graph
0 references
synchronized parallel computation
0 references
