The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation-Reference-Cited by-同舟云学术

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation

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:

Chang Yi-Jun¹,Fischer Manuela²,Ghaffari Mohsen²,Uitto Jara³,Zheng Yufan¹

Affiliation:

1. University of Michigan, Ann Arbor, MI, USA

2. ETH Zurich, Zurich, Switzerland

3. ETH Zurich & University of Freiburg, Zurich, Switzerland

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference49 articles.

1. Access to Data and Number of Iterations

2. Noga Alon and Joel H. Spencer. 2016. The Probabilistic Method 4th ed.). Wiley Publishing. Noga Alon and Joel H. Spencer. 2016. The Probabilistic Method 4th ed.). Wiley Publishing.

3. Parallel algorithms for geometric graph problems

4. Parallel Graph Connectivity in Log Diameter Rounds

5. Sepehr Assadi. 2017. Simple round compression for parallel vertex cover. arXiv preprint arXiv:1709.04599 (2017). Sepehr Assadi. 2017. Simple round compression for parallel vertex cover. arXiv preprint arXiv:1709.04599 (2017).

Cited by 45 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. Adaptive Massively Parallel Coloring in Sparse Graphs;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

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

4. (Δ+1) Vertex Coloring in O ( n ) Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

5. 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