Back to papers
Efficient Route Planning on Public Transportation Networks: A Labelling Approach
Summary: TTL is a label-based index for timetable graphs, where each node stores labels for the shortest travel time to other nodes given a departure time. It supports three query types, uses preprocessing and label compression to trim space, and real-data experiments show faster queries with moderate overhead.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5074
- Venue
- SIGMOD
- Year
- 2015
- Pagerank
- 0.00011384233
- Overall Rank
- 1,554 | 89.21%
- DOI
-
10.1145/2723372.2749456
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,893 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010175836 |
| 2,192 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3282272e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 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 |
| 5,255 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.5991117e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 7,345 |
Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand |
2021 |
SIGMOD |
4.7508931e-05 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
| 9,207 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3694476e-05 |
| 10,135 |
ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,408 |
Bursting Flow Query on Large Temporal Flow Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 11,068 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.1905499e-05 |
| 11,501 |
Towards Crowd-aware Indoor Path Planning |
2021 |
VLDB |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,893 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010175836 |
| 4,620 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0368524e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |
| 10,677 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
4.1905499e-05 |
| 9,472 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3300131e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 11,068 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.1905499e-05 |