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 (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. Yang Lu (University of Technology Sydney)
- 7. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{xu_sigmod25,
title = {{Minimum Spanning Tree Maintenance in Dynamic Graphs}},
author = {Xu, Lantian and Wen, Dong and Qin, Lu and Li, Ronghua and Zhang, Ying and Lu, Yang and Lin, Xuemin},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709704},
url = {https://dl.acm.org/doi/10.1145/3709704},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 5.093636e-05 |
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,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.6959807e-05 |
| 3,312 | On Querying Historical K-Cores | 2021 | VLDB | 7.5309892e-05 |
| 3,594 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 7.2736453e-05 |
| 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 5.9853864e-05 |
| 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 2 | 2,243 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD |
| 3 | 8,657 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD |
| 4 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 5 | 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB |
| 6 | 11,105 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |
| 7 | 7,578 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB |
| 8 | 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB |
| 9 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 10 | 5,028 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |