Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:39, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel graph algorithms for coarse-grained multicomputers and BSP |
scientific article |
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
