A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (Q5368957): Difference between revisions
From MaRDI portal
Item:Q5368957
Changed an Item |
EloiFerrer (talk | contribs) Page moved from [mardi:Publication:5368957] to [mardi:Publication:5133968] |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:12, 2 May 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