Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model (Q3801099)
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: Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model |
scientific article; zbMATH DE number 4068321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model |
scientific article; zbMATH DE number 4068321 |
Statements
Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model (English)
0 references
1988
0 references
EREW PRAM
0 references
parallel algorithms
0 references
connected components
0 references
spanning forest
0 references
fundamental cycle
0 references
bridges
0 references
bipartiteness
0 references
data structures
0 references
0.9713266
0 references
0.8950471
0 references
0.88665754
0 references
0.8810804
0 references
0.87969327
0 references
0.8792204
0 references
