DeepAI AI Chat
Log In Sign Up

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

by   Christian Konrad, et al.
University of Warwick

We give a maximal independent set (MIS) algorithm that runs in O(Δ) rounds in the congested clique model, where Δ is the maximum degree of the input graph. This improves upon the O((Δ) ·Δ/√( n) + Δ ) rounds algorithm of [Ghaffari, PODC '17], where n is the number of vertices of the input graph. In the first stage of our algorithm, we simulate the first O(n/poly n) iterations of the sequential random order Greedy algorithm for MIS in the congested clique model in O(Δ) rounds. This thins out the input graph relatively quickly: After this stage, the maximum degree of the residual graph is poly-logarithmic. In the second stage, we run the MIS algorithm of [Ghaffari, PODC '17] on the residual graph, which completes in O(Δ) rounds on graphs of poly-logarithmic degree.


page 1

page 2

page 3

page 4


A Faster Isomorphism Test for Graphs of Small Degree

Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...

Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space

The Massive Parallel Computation (MPC) model is a theoretical framework ...

Congested Clique Algorithms for Graph Spanners

Graph spanners are sparse subgraphs that faithfully preserve the distanc...

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

An (ϵ,ϕ)-expander decomposition of a graph G=(V,E) is a clustering of th...

Distributed Triangle Detection via Expander Decomposition

We present improved distributed algorithms for triangle detection and it...

Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs

Given a graph, a maximal independent set (MIS) is a maximal subset of pa...

Finding cliques using few probes

Consider algorithms with unbounded computation time that probe the entri...