Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632): Difference between revisions
From MaRDI portal
Latest revision as of 13:04, 26 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model |
scientific article |
Statements
Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (English)
0 references
6 September 2021
0 references
distributed computing
0 references
minimum spanning tree
0 references
broadcast tree
0 references
0 references
0 references
0 references
0 references