Minimum Spanning Trees in Temporal Graphs
Summary: Defines two MST notions for temporal graphs (MST_a by time, MST_w by cost) and gives a linear-time algorithm for MST_a. Proposes DST-based approximations for MST_w, improves DST time/approximation, and achieves speedups (10 hours to 3 seconds) on real temporal networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Silu Huang (Chinese University of Hong Kong)
- 2. Ada Wai-Chee Fu (Chinese University of Hong Kong)
- 3. Ruifeng Liu (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{huang_sigmod15,
title = {{Minimum Spanning Trees in Temporal Graphs}},
author = {Huang, Silu and Fu, Ada Wai-Chee and Liu, Ruifeng},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2723717},
url = {https://dl.acm.org/doi/10.1145/2723372.2723717},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,376 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB | 7.3590905e-05 |
| 7,772 | A Graph Database for a Virtualized Network Infrastructure | 2018 | SIGMOD | 5.4553959e-05 |
| 8,538 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 5.3203262e-05 |
| 10,613 | ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks | 2026 | SIGMOD | 4.9793485e-05 |
| 11,123 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00011996469 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,812 | A Practical Sublinear Approximation for Group Steiner Tree | 2026 | VLDB |
| 2 | 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 3 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 4 | 4,175 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB |
| 5 | 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |
| 6 | 6,098 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS |
| 7 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 8 | 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB |
| 9 | 4,604 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB |
| 10 | 11,112 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD |