Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover-Reference-Cited by-同舟云学术

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

Published:2018-07-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Ghaffari Mohsen¹,Gouleakis Themis²,Konrad Christian³,Mitrović Slobodan⁴,Rubinfeld Ronitt⁵

Affiliation:

1. ETH Zürich, Zurich, Switzerland

2. Massachusetts Institute of Technology, Cambridge, MA, USA

3. University of Bristol, Bristol, United Kingdom

4. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

5. Massachusetts Institute of Technology & Tel Aviv University, Cambridge, MA, USA

Funder

National Science Foundation

Israel Science Foundation

Engineering and Physical Sciences Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3212734.3212743

Reference44 articles.

1. Access to Data and Number of Iterations

2. A fast and simple randomized parallel algorithm for the maximal independent set problem

3. Parallel algorithms for geometric graph problems

4. Sepehr Assadi . 2017. Simple Round Compression for Parallel Vertex Cover. CoRR Vol. abs/1709.04599 (September . 2017). deftempurl%https://arxiv.org/abs/1709.04599 tempurl Sepehr Assadi . 2017. Simple Round Compression for Parallel Vertex Cover. CoRR Vol. abs/1709.04599 (September . 2017). deftempurl%https://arxiv.org/abs/1709.04599 tempurl

Cited by 62 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Massively Parallel Algorithms for Approximate Shortest Paths;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Brief Announcement: Massively Parallel Ruling Set Made Deterministic;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. Streaming Graph Algorithms in the Massively Parallel Computation Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

4. Lenzen’s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10