Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013)
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: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP |
scientific article; zbMATH DE number 1756781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel graph algorithms for coarse-grained multicomputers and BSP |
scientific article; zbMATH DE number 1756781 |
Statements
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (English)
0 references
17 June 2002
0 references
coarse grained parallel computing
0 references
graph algorithms
0 references
0.9987955
0 references
0.93814206
0 references
0.92680043
0 references
0.9188721
0 references
