Path Problems in Temporal Graphs
Summary: Shows classic shortest paths fail in temporal graphs where time order matters; introduces temporally-aware path notions. Presents algorithms for temporal-paths; shows subpaths need not be shortest; validates on data, contrasting with static shortest paths. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Huanhuan Wu
- 2. James Cheng
- 3. Silu Huang
- 4. Yiping Ke
- 5. Yi Lu
- 6. Yanyan Xu
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
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 |
|---|---|---|---|---|
| 1,838 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 0.00010349881 |
| 1,880 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010226347 |
| 2,756 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.1682536e-05 |
| 4,067 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4795399e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,115 | Finding Time Period-Based Most Frequent Path in Big Trajectory Data | 2013 | SIGMOD | 0.00013894562 |
| 4,970 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.7945079e-05 |
| 8,918 | Time-Topology Analysis | 2021 | VLDB | 4.427232e-05 |
| 8,242 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.551877e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 5,540 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB | 5.4498271e-05 |
| 4,973 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 5.7909705e-05 |
| 5,366 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5460085e-05 |
| 3,164 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 7.4543722e-05 |
| 4,430 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB | 6.1942479e-05 |