Toward optimal bounds in the congested clique, graph connectivity and MST (Q2796246)
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: Toward optimal bounds in the congested clique, graph connectivity and MST |
scientific article; zbMATH DE number 6560044
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward optimal bounds in the congested clique, graph connectivity and MST |
scientific article; zbMATH DE number 6560044 |
Statements
23 March 2016
0 references
congested clique
0 references
graph connectivity
0 references
graph sketches
0 references
message complexity
0 references
minimum spanning tree
0 references
randomization
0 references
0.9201579
0 references
0.9103253
0 references
0.90359485
0 references
0.9023128
0 references
0.89490324
0 references
0.8948549
0 references
Toward optimal bounds in the congested clique, graph connectivity and MST (English)
0 references
