Back to papers
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
Summary: Pruned Landmark Labeling for exact shortest-path queries on large networks; BFS with pruning reduces label sizes and search space. Bit-parallelism runs 32–64 BFSs simultaneously, enabling scalable, exact distances on graphs with hundreds of millions of edges and competitive query times.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 4723
- Venue
- SIGMOD
- Year
- 2013
- Pagerank
- 0.00030020929
- Overall Rank
- 260 | 98.20%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 64 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 10,477 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 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,608 |
Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints |
2025 |
VLDB |
4.1905499e-05 |
| 10,878 |
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks |
2025 |
VLDB |
4.1905499e-05 |
| 10,960 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,005 |
LION: Fast and High-Resolution Network Kernel Density Visualization |
2024 |
VLDB |
4.1905499e-05 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,241 |
TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks |
2023 |
VLDB |
4.1905499e-05 |
| 11,266 |
Approximating Probabilistic Group Steiner Trees in Graphs |
2023 |
VLDB |
4.1905499e-05 |
| 11,536 |
SpeakNav: Voice-based Route Description Language Understanding for Template-driven Path Search |
2021 |
VLDB |
4.1905499e-05 |
| 11,582 |
BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks |
2020 |
SIGMOD |
4.1905499e-05 |
| 11,664 |
Answering Why-questions by Exemplars in Attributed Graphs |
2019 |
SIGMOD |
4.1905499e-05 |
| 11,936 |
CANDS: Continuous Optimal Navigation via Distributed Stream Processing |
2015 |
VLDB |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |
| 7,240 |
Toward a Distance Oracle for Billion-Node Graphs |
2014 |
VLDB |
4.7869144e-05 |
| 8,504 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
4.491551e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 502 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021528261 |
| 1,385 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012259478 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 6,144 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
5.1865526e-05 |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |