Minimum Spanning Tree Maintenance in Dynamic Graphs
Summary: Proposes a practical dynamic MST maintenance algorithm that maintains a replacement edge for every tree edge to enable immediate updates when a tree edge is deleted. Sharing computation across replacement-edge maintenance yields scalable performance; experiments on large graphs show substantial improvements over state-of-the-art. (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
- 2. Dong Wen
- 3. Lu Qin
- 4. Ronghua Li
- 5. Ying Zhang
- 6. Yang Lu
- 7. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,146 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.477231e-05 |
| 3,639 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 6.8913642e-05 |
| 4,139 | On Querying Historical K-Cores | 2021 | VLDB | 6.415046e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next