| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 1,555 |
Efficient Route Planning on Public Transportation Networks: A Labelling Approach |
2015 |
SIGMOD |
0.00011395261 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 1,823 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010413508 |
| 1,836 |
Distance-generalized Core Decomposition |
2019 |
SIGMOD |
0.00010365753 |
| 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,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,805 |
All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis |
2014 |
PODS |
8.0918347e-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 |
| 3,668 |
The LDBC Social Network Benchmark: Business Intelligence Workload |
2023 |
VLDB |
6.8591612e-05 |
| 3,671 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8560247e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 4,359 |
Astrid: Accurate Selectivity Estimation for String Predicates using Deep Learning |
2021 |
VLDB |
6.2569955e-05 |
| 4,430 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.1942479e-05 |
| 4,542 |
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks |
2020 |
SIGMOD |
6.1019408e-05 |
| 4,621 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0426586e-05 |
| 4,836 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
5.8896897e-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 |
| 5,291 |
Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints |
2020 |
VLDB |
5.5826473e-05 |
| 5,479 |
Microblog Entity Linking with Social Temporal Context |
2015 |
SIGMOD |
5.4850984e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 5,932 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
5.2670741e-05 |
| 6,059 |
Cache-Efficient Fork-Processing Patterns on Large Graphs |
2021 |
SIGMOD |
5.2307519e-05 |
| 6,138 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
5.1915368e-05 |
| 6,208 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1568586e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 6,971 |
BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks |
2018 |
SIGMOD |
4.8792893e-05 |
| 7,277 |
Exact Top-k Nearest Keyword Search in Large Networks |
2015 |
SIGMOD |
4.7794907e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 7,441 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
4.7302202e-05 |
| 7,762 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6583829e-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 |
| 9,089 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.39898e-05 |
| 9,205 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3736393e-05 |
| 9,283 |
Adaptive Indexing in High-Dimensional Metric Spaces |
2023 |
VLDB |
4.3631652e-05 |
| 9,360 |
MITra: A Framework for Multi-Instance Graph Traversal |
2023 |
VLDB |
4.350809e-05 |
| 9,495 |
Fast Network K-function-based Spatial Analysis |
2022 |
VLDB |
4.3341665e-05 |
| 9,952 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
4.2405999e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,209 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
4.1945683e-05 |