Exponentially Faster Shortest Paths in the Congested Clique (Q5889790)
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 7679912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponentially Faster Shortest Paths in the Congested Clique |
scientific article; zbMATH DE number 7679912 |
Statements
Exponentially Faster Shortest Paths in the Congested Clique (English)
0 references
27 April 2023
0 references
shortest paths
0 references
congested clique
0 references
near-additive emulator
0 references
0.9967739582061768
0 references
0.9390021562576294
0 references
0.9388881921768188
0 references
0.8791316747665405
0 references
