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
- 2. Ada Wai-Chee Fu
- 3. Ruifeng Liu
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,208 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB | 6.357214e-05 |
| 7,143 | A Graph Database for a Virtualized Network Infrastructure | 2018 | SIGMOD | 4.8191495e-05 |
| 8,242 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.551877e-05 |
| 10,135 | ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks | 2026 | SIGMOD | 4.1945683e-05 |
| 10,397 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 4.1945683e-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,024 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014609643 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-05 |
| 4,973 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 5.7909705e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 3,164 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 7.4543722e-05 |
| 11,493 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1945683e-05 |
| 5,492 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS | 5.4771871e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 1,024 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014609643 |
| 4,430 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB | 6.1942479e-05 |
| 10,383 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.1945683e-05 |