Parallel Shortest Paths Using Radius Stepping-Reference-Cited by-同舟云学术

Parallel Shortest Paths Using Radius Stepping

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

Author:

Blelloch Guy E.¹,Gu Yan¹,Sun Yihan¹,Tangwongsan Kanat²

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

2. Mahidol University International College, Nakhonpathom, Thailand

Funder

National Science Foundation

Publisher

ACM

Link

Reference29 articles.

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

1. A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP;2023 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C);2023-08-24

3. Communication-Efficient ∆-Stepping for Distributed Computing Systems;2023 19th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob);2023-06-21

4. High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

5. A scalable architecture for reprioritizing ordered parallelism;Proceedings of the 49th Annual International Symposium on Computer Architecture;2022-06-11