Parallel Strong Connectivity Based on Faster Reachability (Abstract)-Reference-Cited by-同舟云学术

Parallel Strong Connectivity Based on Faster Reachability (Abstract)

Published:2023-07-18 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing
language:
Short-container-title:

Author:

Wang Letong¹^ORCID,Dong Xiaojun¹^ORCID,Gu Yan¹^ORCID,Sun Yihan¹^ORCID

Affiliation:

1. University of California, Riverside, Riverside, CA, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference7 articles.

1. V Aho Alfred , E Hopcroft John , D Ullman Jeffrey , V Aho Alfred , H Bracht Glenn , D Hopkin Kenneth , C Stanley Julian , Brachu Jean-Pierre , Brown A Samler , Brown A Peter , 1983 . Data structures and algorithms. USA: Addison-Wesley. V Aho Alfred, E Hopcroft John, D Ullman Jeffrey, V Aho Alfred, H Bracht Glenn, D Hopkin Kenneth, C Stanley Julian, Brachu Jean-Pierre, Brown A Samler, Brown A Peter, et al. 1983. Data structures and algorithms. USA: Addison-Wesley.

2. Guy E. Blelloch , Yan Gu , Julian Shun , and Yihan Sun . 2020. Parallelism in Randomized Incremental Algorithms. J. ACM ( 2020 ). Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun. 2020. Parallelism in Randomized Incremental Algorithms. J. ACM (2020).

3. The Graph Based Benchmark Suite (GBBS)

4. iSpan: Parallel Identification of Strongly Connected Components with Spanning Trees

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

1. Provably Fast and Space-Efficient Parallel Biconnectivity;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21