| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 1,054 |
On k-skip Shortest Paths |
2011 |
SIGMOD |
0.00014422699 |
| 1,378 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012294512 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 1,821 |
Computing Personalized PageRank Quickly by Exploiting Graph Structures |
2014 |
VLDB |
0.00010423565 |
| 1,823 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010413508 |
| 1,838 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010349881 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,756 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
8.1682536e-05 |
| 3,342 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.197276e-05 |
| 3,639 |
On Querying Historical Evolving Graph Sequences |
2011 |
VLDB |
6.8913642e-05 |
| 4,067 |
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach |
2012 |
SIGMOD |
6.4795399e-05 |
| 4,111 |
Effective Caching of Shortest Paths for Location-Based Services |
2012 |
SIGMOD |
6.4427171e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 4,949 |
Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs |
2013 |
VLDB |
5.8113132e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,215 |
Relational Approach for Shortest Path Discovery over Large Graphs |
2012 |
VLDB |
5.6228603e-05 |
| 5,932 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
5.2670741e-05 |
| 6,138 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
5.1915368e-05 |
| 6,172 |
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs |
2019 |
VLDB |
5.170101e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 7,277 |
Exact Top-k Nearest Keyword Search in Large Networks |
2015 |
SIGMOD |
4.7794907e-05 |
| 7,441 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
4.7302202e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 7,863 |
Adaptive Optimizations of Recursive Queries in Teradata |
2012 |
SIGMOD |
4.6328993e-05 |
| 7,897 |
Correlation Constraint Shortest Path over Large Multi-Relation Graphs |
2019 |
VLDB |
4.6230399e-05 |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
| 8,967 |
Planting Trees for scalable and efficient Canonical Hub Labeling |
2020 |
VLDB |
4.4190656e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,874 |
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks |
2025 |
VLDB |
4.1945683e-05 |
| 11,065 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.1945683e-05 |