Parallel Strong Connectivity Based on Faster Reachability
Summary: Parallel SCC with vertical granularity control (VGC) and a parallel hash bag to reduce synchronization and frontier work. On 96-core hardware, it outperforms GBBS, Tarjan, and prior best across 18 graphs; extends to connectivity and LE-lists. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Letong Wang (University of California Riverside)
- 2. Xiaojun Dong (University of California Riverside)
- 3. Yan Gu (University of California Riverside)
- 4. Yihan Sun (University of California Riverside)
BibTeX Citation
@inproceedings{wang_sigmod23,
title = {{Parallel Strong Connectivity Based on Faster Reachability}},
author = {Wang, Letong and Dong, Xiaojun and Gu, Yan and Sun, Yihan},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589259},
url = {https://dl.acm.org/doi/10.1145/3589259},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,095 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 5.3739121e-05 |
| 8,846 | Fast and Space-Efficient Parallel Algorithms for Influence Maximization | 2024 | VLDB | 5.2498988e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012089097 |
| 331 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00020800828 |
| 1,564 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010186448 |
| 2,350 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 8.5846492e-05 |
| 2,782 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 8.0054142e-05 |
| 3,101 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.6310428e-05 |
| 7,002 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.6075959e-05 |
| 7,986 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 5.3960574e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,046 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD |
| 2 | 4,567 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 3 | 4,395 | Graph Analytics Through Fine-Grained Parallelism | 2016 | SIGMOD |
| 4 | 1,960 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 5 | 3,697 | Parallel Local Graph Clustering | 2016 | VLDB |
| 6 | 6,666 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB |
| 7 | 7,986 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB |
| 8 | 3,101 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB |
| 9 | 12,579 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 10 | 8,095 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD |