Constant-time Connectivity Querying in Dynamic Graphs
Summary: Constant-time connectivity queries for fully dynamic undirected graphs using a novel hybrid of per-component spanning trees and a disjoint-set (DS) tree. Concurrent maintenance of both trees yields true constant query time and significantly improved edge insert/delete times, outperforming the D-tree on real datasets. (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. Lantian Xu (University of Technology Sydney)
- 2. Dong Wen (University of New South Wales)
- 3. Lu Qin (University of Technology Sydney)
- 4. Ronghua Li (Beijing Institute of Technology)
- 5. Ying Zhang (University of Technology Sydney)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{xu_sigmod24,
title = {{Constant-time Connectivity Querying in Dynamic Graphs}},
author = {Xu, Lantian and Wen, Dong and Qin, Lu and Li, Ronghua and Zhang, Ying and Lin, Xuemin},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3698805},
url = {https://dl.acm.org/doi/10.1145/3698805},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,479 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 11,112 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.9793485e-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 |
|---|---|---|---|---|
| 274 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022490994 |
| 294 | Efficient Management of Transitive Relationships in Large Data and Knowledge Bases | 1989 | SIGMOD | 0.00021927874 |
| 1,563 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010224369 |
| 1,849 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 9.5068688e-05 |
| 3,217 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.5233036e-05 |
| 4,049 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB | 6.8302372e-05 |
| 6,177 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 5.8598586e-05 |
| 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 5.8510904e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 2 | 1,849 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 3 | 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 4 | 3,921 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 5 | 6,061 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB |
| 6 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 7 | 11,112 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD |
| 8 | 11,455 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |
| 9 | 8,819 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD |
| 10 | 3,217 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB |