Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model |
scientific article; zbMATH DE number 7391414
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model |
scientific article; zbMATH DE number 7391414 |
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
0.8992644
0 references
0.8992644
0 references
0.8980943
0 references
0.89641625
0 references
0.8726337
0 references
0.87201995
0 references
