Efficient decomposition of strongly connected components on GPUs-Reference-Cited by-同舟云学术

Efficient decomposition of strongly connected components on GPUs

Published:2014-01 Issue:1 Volume:60 Page:1-10
ISSN:1383-7621
Container-title:Journal of Systems Architecture
language:en
Short-container-title:Journal of Systems Architecture

Author:

Li Guohui,Zhu Zhe,Cong Zhang,Yang Fumin

Publisher

Elsevier BV

Subject

Hardware and Architecture,Software

Reference27 articles.

1. L.K. Fleischer, B. Hendrickson, A. Pinar. On identifying strongly connected components in parallel, in: Parallel and Distributed Processing, vol. 1800 of LNCS, Springer, 2000, pp. 505–511.

2. S. Orzan. On Distributed Verification and Verified Distribution, PhD thesis, Free University of Amsterdam, 2004.

3. D. Coppersmith, L. Fleischer, B. Hendrickson, A. Pinar. A divide-and-conquer algorithm for identifying strongly connected components, Technical Report RC23744, IBM Research, 2005.

4. Distributed algorithms for SCC decomposition;Barnat;J. Logic Comp.,2011

5. J. Barnat, P. Moravec, Parallel Algorithms for Finding SCCs in Implicitly Given Graphs, in: Formal Methods: Applications and Technology, vol. 4346 of LNCS, Springer, 2006, pp. 316–330.

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

1. Minimum Strongly Connected Subgraph Collection in Dynamic Graphs;Proceedings of the VLDB Endowment;2024-02

2. A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs;2023 IEEE 35th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD);2023-10-17

3. On Querying Connected Components in Large Temporal Graphs;Proceedings of the ACM on Management of Data;2023-06-13

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

5. Constraint propagation on GPU: A case study for the AllDifferent constraint;Journal of Logic and Computation;2023-06-06