Fast approximate shortest paths in the congested clique (Q2064057)
From MaRDI portal
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
