Graph algorithms with small communication costs (Q1587586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1538190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph algorithms with small communication costs |
scientific article; zbMATH DE number 1538190 |
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
0.8159605860710144
0 references
0.811079204082489
0 references
