Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q5090930)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7561289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model |
scientific article; zbMATH DE number 7561289 |
Statements
21 July 2022
0 references
distributed computing
0 references
minimum spanning tree
0 references
broadcast tree
0 references
0 references
0 references
0.998309314250946
0 references
0.8689702153205872
0 references
0.8535305261611938
0 references
0.8175027370452881
0 references
