Fast approximate shortest paths in the congested clique (Q2064057): 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.1007/s00446-020-00380-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3028705187 / rank | |||
Normal rank | |||
Revision as of 23:07, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximate shortest paths in the congested clique |
scientific article |
Statements
Fast approximate shortest paths in the congested clique (English)
0 references
4 January 2022
0 references
distributed computing
0 references
congested clique model
0 references
all-pairs shortest paths
0 references
matrix multiplication
0 references
hopsets
0 references
