Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable-Reference-Cited by-同舟云学术

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Dhulipala Laxman¹,Blelloch Guy E.¹,Shun Julian²

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

2. MIT CSAIL, Boston, MA, USA

Funder

NSF

Publisher

ACM

Link

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

Reference91 articles.

1. Parallel depth-first search in general directed graphs

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

3. R. Anderson and E. W. Mayr. A $mathsfP$-complete problem and approximations to it. Technical report 1984. R. Anderson and E. W. Mayr. A $mathsfP$-complete problem and approximations to it. Technical report 1984.

4. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

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

1. A Framework for Parallelizing Approximate Gaussian Elimination;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30

3. CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

4. Parallel Integer Sort: Theory and Practice;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

5. Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20