Fast approximate shortest paths in the congested clique (Q2064057)
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 7451881
| 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 7451881 |
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
0 references
0.8955979347229004
0 references
0.8497331738471985
0 references
0.8437482714653015
0 references
0.8388799428939819
0 references
