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
- 2. Xiaojun Dong
- 3. Yan Gu
- 4. Yihan Sun
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,495 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 4.1945683e-05 |
| 11,080 | Fast and Space-Efficient Parallel Algorithms for Influence Maximization | 2024 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027081079 |
| 1,880 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010226347 |
| 2,336 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 9.0109891e-05 |
| 2,927 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.8823626e-05 |
| 2,938 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8524059e-05 |
| 6,504 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0357556e-05 |
| 7,871 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6308128e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,500 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011674394 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 4,845 | Graph Analytics Through Fine-Grained Parallelism | 2016 | SIGMOD | 5.8795333e-05 |
| 1,685 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 0.0001091808 |
| 3,597 | Parallel Local Graph Clustering | 2016 | VLDB | 6.9345175e-05 |
| 6,513 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0321577e-05 |
| 7,871 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6308128e-05 |
| 2,927 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.8823626e-05 |
| 12,041 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1945683e-05 |
| 10,495 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 4.1945683e-05 |