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,505 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 4.1905499e-05 |
| 11,083 | Fast and Space-Efficient Parallel Algorithms for Influence Maximization | 2024 | VLDB | 4.1905499e-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.0019040811 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027077424 |
| 1,879 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010227906 |
| 2,332 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 9.0173968e-05 |
| 2,916 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.9062736e-05 |
| 2,943 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8463193e-05 |
| 6,499 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0307246e-05 |
| 7,874 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6263724e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,487 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011691164 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 4,845 | Graph Analytics Through Fine-Grained Parallelism | 2016 | SIGMOD | 5.8731048e-05 |
| 1,684 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 0.00010912102 |
| 3,600 | Parallel Local Graph Clustering | 2016 | VLDB | 6.9285467e-05 |
| 7,874 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6263724e-05 |
| 6,509 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0273291e-05 |
| 2,916 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.9062736e-05 |
| 12,049 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1905499e-05 |
| 10,505 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 4.1905499e-05 |