Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs
Summary: Proposes the D-tree, the first fully dynamic graph structure that scales to millions of vertices and edges, with dedicated construction and maintenance for connectivity queries. On average, it outperforms worst-case guaranteed structures in connectivity queries on large dynamic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qing Chen (University of Zurich)
- 2. Oded Lachish (Birkbeck, University of London)
- 3. Sven Helmer (University of Zurich)
- 4. Michael H. Böhlen (University of Zurich)
BibTeX Citation
@article{chen_vldb22,
title = {{Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs}},
author = {Chen, Qing and Lachish, Oded and Helmer, Sven and Böhlen, Michael H.},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {3263--3276},
doi = {10.14778/3551793.3551868},
url = {https://doi.org/10.14778/3551793.3551868},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 5.8510904e-05 |
| 7,013 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB | 5.6211413e-05 |
| 8,819 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD | 5.2698104e-05 |
| 9,731 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 5.1349531e-05 |
| 11,112 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.9793485e-05 |
| 11,341 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB | 4.9793485e-05 |
| 11,455 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.9793485e-05 |
| 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 239 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.000235107 |
| 274 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022490994 |
| 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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 2 | 2,869 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 3 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 4 | 4,527 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD |
| 5 | 7,547 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB |
| 6 | 6,061 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB |
| 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 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |