A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (Q5368957): Difference between revisions
From MaRDI portal
Item:Q5368957
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:38, 9 February 2024
scientific article; zbMATH DE number 6789785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities |
scientific article; zbMATH DE number 6789785 |
Statements
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (English)
0 references
11 October 2017
0 references
Bellman-Ford algorithm
0 references
distributed shortest paths
0 references
