Towards Scalable and Practical Batch-Dynamic Connectivity
Summary: First parallel, work-efficient batch-dynamic connectivity algorithm supporting batched inserts/deletes, polylogarithmic depth, and linear total space. Implements the cluster forest and shows practical wins—up to 19.7× less space and 6.2× faster than HLT level-set. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Quinten De Man
- 2. Laxman Dhulipala
- 3. Adam Karczmarz
- 4. Jakub Łącki
- 5. Julian Shun
- 6. Zhongqi Wang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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,146 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.477231e-05 |
| 3,264 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.3094408e-05 |
| 4,236 | Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs | 2021 | SIGMOD | 6.3335374e-05 |
| 4,657 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0187213e-05 |
| 7,871 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6308128e-05 |
Previous
Page 1 / 1
Next