Constrained Shortest Path Query in a Large Time-Dependent Graph
Summary: Constrained shortest-path queries in large time-dependent graphs; defines PCSP and ICSP. NP-completeness for PCSP and EXPSPACE for ICSP; introduces approximate sequential algorithms and parallel scalable solutions, with real-network experiments confirming efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ye Yuan (Beijing Institute of Technology)
- 2. Xiang Lian (Kent State University)
- 3. Guoren Wang (Beijing Institute of Technology)
- 4. Yuliang Ma (Northeastern University, China)
- 5. Yishu Wang (Northeastern University, China)
BibTeX Citation
@article{yuan_vldb19,
title = {{Constrained Shortest Path Query in a Large Time-Dependent Graph}},
author = {Yuan, Ye and Lian, Xiang and Wang, Guoren and Ma, Yuliang and Wang, Yishu},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {10},
pages = {1058--1070},
doi = {10.14778/3339490.3339491},
url = {https://doi.org/10.14778/3339490.3339491},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,786 | Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks | 2020 | SIGMOD | 6.5083151e-05 |
| 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 5.824568e-05 |
| 8,365 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 5.44244e-05 |
| 10,424 | ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks | 2026 | SIGMOD | 5.093636e-05 |
| 10,683 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 5.093636e-05 |
| 11,401 | QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks | 2023 | SIGMOD | 5.093636e-05 |
| 11,695 | Towards Crowd-aware Indoor Path Planning | 2021 | VLDB | 5.093636e-05 |
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,123 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00012089975 |
| 1,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD | 0.00010242826 |
| 4,135 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 6.8814581e-05 |
| 4,541 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB | 6.6397712e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,401 | QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks | 2023 | SIGMOD |
| 2 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 3 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 4 | 5,028 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 5 | 2,555 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB |
| 6 | 4,135 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB |
| 7 | 9,815 | PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks | 2024 | VLDB |
| 8 | 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 9 | 1,123 | Path Problems in Temporal Graphs | 2014 | VLDB |
| 10 | 4,541 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB |