A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities |
No description defined |
Statements
A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (English)
0 references
11 November 2020
0 references
distributed graph algorithms
0 references
minimum spanning tree
0 references
