A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:11, 8 February 2024
scientific article; zbMATH DE number 7273084
| 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 7273084 |
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
