An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs
Summary: Experimental comparison of tree-data structures for connectivity on fully-dynamic undirected graphs; reference implementations. Findings: no deployment-ready solutions; balanced trees incur space/time overheads; compact variants risk worst-case slowdown. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qing Chen
- 2. Michael H. Böhlen
- 3. Sven Helmer
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,161 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,962 | Kuzu* Graph Database Management System | 2023 | CIDR | 7.8101752e-05 |
| 3,146 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.477231e-05 |
| 3,729 | Sortledton: a Universal, Transactional Graph Data Structure | 2022 | VLDB | 6.8133526e-05 |
| 3,779 | Instance-Optimized Data Layouts for Cloud Analytics Workloads | 2021 | SIGMOD | 6.7747205e-05 |
| 4,708 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 5.980172e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 7,627 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB | 4.6928167e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 6,725 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB | 4.9484066e-05 |
| 8,630 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 4.480887e-05 |
| 1,777 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.00010589591 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 8,169 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 4.5698941e-05 |
| 10,383 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 10,882 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1945683e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 3,146 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.477231e-05 |