Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
PODC '18: ACM Symposium on Principles of Distributed Computing Egham United Kingdom July, 2018, pp. 129-138, 2019.
We present O(loglog n) -round algorithms in the Massively Parallel Computation (MPC) model, with Õ (n) memory per machine, that compute a maximal independent set, a 1+ε approximation of maximum matching, and a 2+εapproximation of minimum vertex cover, for any n-vertex graph and any constant \eps>0. These improve the state of the art as fo...More
PPT (Upload PPT)