Graph algorithms with small communication costs (Q1587586): 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:12, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph algorithms with small communication costs |
scientific article |
Statements
Graph algorithms with small communication costs (English)
0 references
3 December 2000
0 references
course-grained parallel algorithms
0 references
list ranking
0 references
shortest path
0 references
permutation graph
0 references
commutation phase
0 references
