Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
We present O(log log 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 ε &...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ACM,
2021-02-17T18:00:33Z.
|
| Subjects: | |
| Online Access: | Get fulltext |