Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs
Summary: Cost-optimal path under a time constraint in time-dependent graphs; earliest-arrival TDSP intuition fails for this objective. Proposes a novel algorithm with time O(kn log n + mk) and space O((n+m)k), validated on real and synthetic-cost data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yajun Yang
- 2. Hong Gao
- 3. Jeffrey Xu Yu
- 4. Jianzhong Li
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,171 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 7.4471807e-05 |
| 4,620 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.0368524e-05 |
| 4,976 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 5.7854051e-05 |
| 9,056 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB | 4.3997447e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030020929 |
| 1,173 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00013501079 |
| 1,694 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00010870205 |
| 3,700 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB | 6.8260499e-05 |
| 4,070 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4739921e-05 |
| 5,221 | Relational Approach for Shortest Path Discovery over Large Graphs | 2012 | VLDB | 5.6180753e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,660 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9672425e-05 |
| 7,339 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB | 4.7530782e-05 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 6,491 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.0368875e-05 |
| 1,893 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB | 0.00010175836 |
| 10,988 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1905499e-05 |
| 5,376 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5407342e-05 |
| 4,976 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 5.7854051e-05 |
| 3,171 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 7.4471807e-05 |
| 1,021 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014608331 |