Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory, Merav Parter · 2020
We present improved deterministic algorithms for approximating shortest paths in the Congested Cliqe model of distributed computing. We obtain poly(log log n)-round algorithms for the following problems in unweighted undirected n-vertex graphs: