MIS in the Congested Clique Model in O(log log Δ) Rounds

We give a maximal independent set (MIS) algorithm that runs in $O(log log Delta)$ rounds in the congested clique model, where $Delta$ is the maximum degree of the input graph. This improves upon the $O(frac{log(Delta) cdot log log Delta}{sqrt{log n}} + log log Delta )$ rounds algorithm of [Ghaffari, PODC u002717], where $n$ is the number ...More