Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique.

Sriram V. Pemmaraju Vivek B. Sardeshmukh

Published in: CoRR (2014)

Keyphrases

minimum weight
log log
spanning tree
maximum weight
positive integer
undirected graph
minimum spanning tree
minimum cost
bipartite graph
greedy heuristic
weighted graph
affine transform
np hard
worst case
objective function
probabilistic model
social network analysis
randomized algorithm
query language