Back to papers
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks
Summary: Introduces Border-based State Move (BSM), an index-driven LCSP solver for labeled road graphs using border-vertex skipping to prune exploration. Shows two orders of magnitude speedup vs top LCSP methods and supports flexible language constraints.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7290
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,516 | 26.85%
- DOI
-
10.1145/3725402
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 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,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |
| 1,444 |
Finding Regular Simple Paths in Graph Databases |
1989 |
VLDB |
0.00011946075 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 2,188 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3372315e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,957 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8198686e-05 |
| 3,213 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3669794e-05 |
| 3,342 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.197276e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 4,745 |
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs |
2016 |
SIGMOD |
5.9573154e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,250 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.6044961e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 2,188 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3372315e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 1,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |