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 (University of Zurich)
- 2. Michael H. Böhlen (University of Zurich)
- 3. Sven Helmer (University of Zurich)
BibTeX Citation
@inproceedings{chen_sigmod25,
title = {{An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs}},
author = {Chen, Qing and Böhlen, Michael H. and Helmer, Sven},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709660},
url = {https://dl.acm.org/doi/10.1145/3709660},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD | 5.093636e-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,126 | Kuzu* Graph Database Management System | 2023 | CIDR | 9.1329991e-05 |
| 3,027 | Sortledton: a Universal, Transactional Graph Data Structure | 2022 | VLDB | 7.8374092e-05 |
| 3,035 | Instance-Optimized Data Layouts for Cloud Analytics Workloads | 2021 | SIGMOD | 7.8297746e-05 |
| 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.6959807e-05 |
| 4,371 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 6.738679e-05 |
| 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 5.9853864e-05 |
| 6,868 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB | 5.7501594e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 2 | 5,977 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB |
| 3 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 4 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 5 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 6 | 7,408 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB |
| 7 | 10,671 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD |
| 8 | 11,105 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |
| 9 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 10 | 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB |