Exponentially Faster Massively Parallel Maximal Matching.
Saved in:
| Title: | Exponentially Faster Massively Parallel Maximal Matching. |
|---|---|
| Authors: | BEHNEZHAD, SOHEIL1 s.behnezhad@northeastern.edu, HAJIAGHAYI, MOHAMMADTAGHI2 hajiagha@cs.umd.edu, HARRIS, DAVID G.2 davidgharris29@gmail.com |
| Source: | Journal of the ACM. Oct2023, Vol. 70 Issue 5, p1-18. 18p. |
| Subject Terms: | *DISTRIBUTED computing, *PARALLEL programming, RANDOM graphs, GRAPH algorithms, APPROXIMATION algorithms |
| Abstract: | The study of approximate matching in the Massively Parallel Computations (MPC) model has recently seen a burst of breakthroughs. Despite this progress, we still have a limited understanding of maximal matching which is one of the central problems of parallel and distributed computing. All known MPC algorithms for maximalmatching either take polylogarithmic time which is considered inefficient, or require a strictly superlinear space of n1+Ω(1) per machine. In this work, we close this gap by providing a novel analysis of an extremely simple algorithm, which is a variant of an algorithm conjectured to work by Czumaj, Lacki, Madry, Mitrovic, Onak, and Sankowski [15]. The algorithm edge-samples the graph, randomly partitions the vertices, and finds a random greedy maximal matching within each partition.We show that this algorithm drastically reduces the vertex degrees. This, among other results, leads to an O(log log Δ) round algorithm for maximal matching with O(n) space (or even mildly sublinear in n using standard techniques). As an immediate corollary, we get a 2 approximate minimum vertex cover in essentially the same rounds and space, which is the optimal approximation factor under standard assumptions. We also get an improved O(log log Δ) round algorithm for 1 + ε approximate matching. All these results can also be implemented in the congested clique model in the same number of rounds. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!