Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

We present O(loglog n) -round algorithms in the Massively Parallel Computation (MPC) model, with O (n) memory per machine, that compute a maximal independent set, a 1+e approximation of maximum matching, and a 2+eapproximation of minimum vertex cover, for any n-vertex graph and any constant epsu003e0. These improve the state of the art as...More