An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages (Q4349697): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1996.0842 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061073017 / rank | |||
Normal rank | |||
Revision as of 02:59, 20 March 2024
scientific article; zbMATH DE number 1051488
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
