ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Summary: ConnectIt provides a framework of diverse sampling and tree-linking/compression strategies to generate hundreds of static and incremental parallel graph connectivity variants. A 72-core study reports 12.4x average speedup over static baselines, sub-10s connectivity on a 3.5B-vertex / 128B-edge graph, and billions-edge/sec incremental throughput, with guidance for variant selection and MSF/SCAN extensions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Laxman Dhulipala
- 2. Changwan Hong
- 3. Julian Shun
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,485 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.1458149e-05 |
| 10,879 | The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering | 2025 | VLDB | 4.1945683e-05 |
| 10,882 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1945683e-05 |
| 11,080 | Fast and Space-Efficient Parallel Algorithms for Influence Maximization | 2024 | VLDB | 4.1945683e-05 |
| 11,191 | Parallel Strong Connectivity Based on Faster Reachability | 2023 | SIGMOD | 4.1945683e-05 |
| 11,383 | ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain | 2022 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 331 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00027214222 |
| 961 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00015001792 |
| 999 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014726563 |
| 2,436 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8252104e-05 |
| 2,927 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.8823626e-05 |
| 3,525 | Single Machine Graph Analytics on Massive Datasets Using Intel Optane DC Persistent Memory | 2020 | VLDB | 7.0080401e-05 |
| 4,485 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.1458149e-05 |
| 9,862 | Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs | 2020 | VLDB | 4.2683554e-05 |
| 11,630 | Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice | 2020 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,597 | Parallel Local Graph Clustering | 2016 | VLDB | 6.9345175e-05 |
| 3,854 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6988744e-05 |
| 2,927 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.8823626e-05 |
| 6,730 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD | 4.9479867e-05 |
| 1,685 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 0.0001091808 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 11,191 | Parallel Strong Connectivity Based on Faster Reachability | 2023 | SIGMOD | 4.1945683e-05 |
| 3,020 | GConnect: A Connectivity Index for Massive Disk-Resident Graphs | 2009 | VLDB | 7.6992238e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 10,882 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1945683e-05 |