An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages (Q4349697)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4349697 |
scientific article; zbMATH DE number 1051488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages |
scientific article; zbMATH DE number 1051488 |
Statements
An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages (English)
0 references
17 December 1997
0 references
distributed program
0 references
0.8256176114082336
0 references
0.8177843689918518
0 references
0.817650556564331
0 references
