Graph algorithms with small communication costs (Q1587586): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1009859026994 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108310473 / rank | |||
Normal rank | |||
Latest revision as of 09:42, 30 July 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
