Fast Approximate Shortest Paths in the Congested Clique (Q5145183)
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 7298658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Approximate Shortest Paths in the Congested Clique |
scientific article; zbMATH DE number 7298658 |
Statements
Fast Approximate Shortest Paths in the Congested Clique (English)
0 references
20 January 2021
0 references
all-pairs shortest paths
0 references
approximation algorithms
0 references
congested clique
0 references
diameter
0 references
distributed computing
0 references
hopsets
0 references
matrix multiplication
0 references
single-source shortest paths
0 references
0.996714174747467
0 references
0.9388881921768188
0 references
0.9388251900672911
0 references
0.894710898399353
0 references
