A work-efficient algorithm for parallel unordered depth-first search-Reference-Cited by-同舟云学术

A work-efficient algorithm for parallel unordered depth-first search

Published:2015-11-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
language:
Short-container-title:

Author:

Acar Umut A.¹,Charguéraud Arthur²,Rainey Mike³

Affiliation:

1. Carnegie Mellon University and Inria

2. Inria & LRI Université, Paris Sud, CNRS

3. Inria

Funder

European Research Council

National Science Foundation

Publisher

ACM

Link

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

Reference50 articles.

1. Stanford large network dataset collection. http://snap.stanford.edu/. Stanford large network dataset collection. http://snap.stanford.edu/.

2. The 9th dimacs implementation challenge 2013. http://www.dis.uniroma1.it/challenge9/. The 9 th dimacs implementation challenge 2013. http://www.dis.uniroma1.it/challenge9/.

3. The 10th dimacs implementation challenge 2014. http://www.cc.gatech.edu/dimacs10/. The 10 th dimacs implementation challenge 2014. http://www.cc.gatech.edu/dimacs10/.

4. Oracle scheduling

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

1. Parallel Strong Connectivity Based on Faster Reachability;Proceedings of the ACM on Management of Data;2023-06-13

2. i S pan : Parallel Identification of Strongly Connected Components with Spanning Trees;ACM Transactions on Parallel Computing;2022-08-18

3. Efficient Complete Event Trend Detection over High-Velocity Streams;50th International Conference on Parallel Processing;2021-08-09

4. A Parallel Implementation of Liveness on Knowledge Graphs under Label Constraints;2021 International Symposium on Theoretical Aspects of Software Engineering (TASE);2021-08

5. Graph Reachability on Parallel Many-Core Architectures;Computation;2020-12-02