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
- 2. Oded Lachish
- 3. Sven Helmer
- 4. Michael H. Böhlen
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
| 9,641 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD | 4.3109001e-05 |
| 10,383 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 10,710 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB | 4.1945683e-05 |
| 10,865 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 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 |
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 |
|---|---|---|---|---|
| 279 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00029113513 |
| 331 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00027214222 |
| 1,777 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.00010589591 |
| 1,880 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010226347 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 5,366 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5460085e-05 |
| 4,657 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0187213e-05 |
| 8,169 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 4.5698941e-05 |
| 6,725 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB | 4.9484066e-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 |
| 9,641 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD | 4.3109001e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |