Super-fast MST Algorithms in the Congested Clique using o(m) Messages.
Sriram V. PemmarajuVivek B. SardeshmukhPublished in: CoRR (2016)
Keyphrases
- learning algorithm
- recently developed
- significant improvement
- times faster
- orders of magnitude
- minimum spanning tree
- data sets
- computational efficiency
- benchmark datasets
- optimization problems
- theoretical analysis
- graphical models
- computationally expensive
- computational cost
- lower bound
- graph theory
- data structure