Efficient Shortest Path Counting on Large Road Networks
Summary: Tree-structured index for counting shortest paths between two vertices in large road networks. Optimizations speed up index construction; experiments on 14 real networks show superior query throughput and a compact index vs state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yu-Xuan Qiu
- 2. Dong Wen
- 3. Lu Qin
- 4. Wentao Li
- 5. Rong-Hua Li
- 6. Ying Zhang
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,524 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD | 4.1905499e-05 |
| 10,592 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB | 4.1905499e-05 |
| 10,677 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB | 4.1905499e-05 |
| 11,041 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB | 4.1905499e-05 |
| 11,067 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 4.1905499e-05 |
| 11,144 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 4.1905499e-05 |
| 11,201 | QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks | 2023 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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 |
| 2,206 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 9.2958349e-05 |
| 3,346 | P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators | 2021 | SIGMOD | 7.1903469e-05 |
| 3,412 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.1194524e-05 |
| 5,933 | Hub Labeling for Shortest Path Counting | 2020 | SIGMOD | 5.2620152e-05 |
| 6,497 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD | 5.0324877e-05 |
Previous
Page 1 / 1
Next