An efficient and fast parallel-connected component algorithm (Q3477960)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient and fast parallel-connected component algorithm |
scientific article; zbMATH DE number 4147511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient and fast parallel-connected component algorithm |
scientific article; zbMATH DE number 4147511 |
Statements
An efficient and fast parallel-connected component algorithm (English)
0 references
1990
0 references
data structures graphs
0 references
computation on discrete structures
0 references
graph
0 references
algorithms
0 references
connectivity
0 references
optimal algorithms
0 references
parallel algorithm
0 references
0.9328774
0 references
0.92036635
0 references
0.91794413
0 references
0.9160006
0 references
0.9145631
0 references
0.91338825
0 references
