An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages (Q6184631)
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 7784174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages |
scientific article; zbMATH DE number 7784174 |
Statements
An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages (English)
0 references
5 January 2024
0 references
0.8950799107551575
0 references
0.7567077875137329
0 references
0.7405558824539185
0 references
0.7199292182922363
0 references
0.717350423336029
0 references
