A deterministic algorithm for the MST problem in constant rounds of congested clique (Q6065240)
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 7765239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic algorithm for the MST problem in constant rounds of congested clique |
scientific article; zbMATH DE number 7765239 |
Statements
A deterministic algorithm for the MST problem in constant rounds of congested clique (English)
0 references
14 November 2023
0 references
congested clique
0 references
deterministic algorithms
0 references
distributed algorithms
0 references
graph algorithms
0 references
MST
0 references
mapreduce
0 references
massively parallel algorithms
0 references
minimum spanning tree
0 references
parallel algorithms
0 references
0.93541384
0 references
0.9121813
0 references
0.8948549
0 references
0.8896912
0 references
0.8850045
0 references
0.87893087
0 references
0.8775505
0 references
0.87382275
0 references
0.86933345
0 references
