A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968)
From MaRDI portal
scientific article; zbMATH DE number 6789785
- A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities
| 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
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (English)
0 references
11 November 2020
0 references
11 October 2017
0 references
distributed graph algorithms
0 references
minimum spanning tree
0 references
Bellman-Ford algorithm
0 references
distributed shortest paths
0 references
