Abstract
Computing a Maximal Independent Set (MIS) is a central problem in distributed graph algorithms. This paper presents an improved randomized distributed algorithm for congested clique model, defined as follows: Given a graph G=(V, E), initially each node knows only its neighbors. Communication happens in synchronous rounds over a complete graph, and per round each node can send O(log n) bits to each other node. We present a randomized algorithm that computes an MIS in O((log Δ)/(√(log n)) + 1 ) ≤ O(√(log Δ)) rounds of congested clique, with high probability. Here Δ denotes the maximum degree in the graph. This improves quadratically on the O(log Δ) algorithm of [Ghaffari, SODA'16]. The core technical novelty in this result is a certain local sparsification technique for MIS, which we believe to be of independent interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
