Massively Parallel Computation of Matching and MIS in Sparse Graphs-Reference-Cited by-同舟云学术

Massively Parallel Computation of Matching and MIS in Sparse Graphs

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

Author:

Behnezhad Soheil¹,Brandt Sebastian²,Derakhshan Mahsa¹,Fischer Manuela²,Hajiaghayi MohammadTaghi¹,Karp Richard M.³,Uitto Jara⁴

Affiliation:

1. University of Maryland, College Park, MD, USA

2. ETH Zurich, Zurich, Switzerland

3. University of California, Berkeley, Berkeley, CA, USA

4. ETH Zurich & University of Freiburg, Zurich/Freiburg, Switzerland

Funder

NSF

DARPA

Publisher

ACM

Link

Reference33 articles.

Cited by 27 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. 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

3. Parallel Derandomization for Coloring*;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

5. Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17