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

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

21 February 2018

Papers citing "MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds"

3 / 3 papers shown

Title
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 81 62 0 11 Jan 2019
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 60 30 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 40 18 0 17 Jul 2018