Path Problems in Temporal Graphs
Summary: Reframes shortest paths for temporal graphs, where traversal order makes static distance misleading and optimal paths lack optimal substructure. Characterizes temporal path notions and develops efficient algorithms, validated on real data and against static-graph analyses. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Huanhuan Wu (Chinese University of Hong Kong)
- 2. James Cheng (Chinese University of Hong Kong)
- 3. Silu Huang (Chinese University of Hong Kong)
- 4. Yiping Ke (Institute of High Performance Computing)
- 5. Yi Lu (Chinese University of Hong Kong)
- 6. Yanyan Xu (Chinese University of Hong Kong)
BibTeX Citation
@article{wu_vldb14,
title = {{Path Problems in Temporal Graphs}},
author = {Wu, Huanhuan and Cheng, James and Huang, Silu and Ke, Yiping and Lu, Yi and Xu, Yanyan},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {9},
pages = {721--732},
doi = {10.14778/2732939.2732943},
url = {https://doi.org/10.14778/2732939.2732943},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 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,563 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010219537 |
| 1,647 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 9.9828268e-05 |
| 2,606 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.2264537e-05 |
| 3,936 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.9140006e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,390 | Finding Time Period-Based Most Frequent Path in Big Trajectory Data | 2013 | SIGMOD |
| 2 | 3,922 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 3 | 9,258 | Time-Topology Analysis | 2021 | VLDB |
| 4 | 8,545 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD |
| 5 | 6,205 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 6 | 5,004 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 7 | 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 8 | 5,151 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 9 | 4,175 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB |
| 10 | 4,606 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB |