Back to papers
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network
Summary: Defines a complete DSP space by determinant/constraint dimensions and benchmarks state-of-the-art methods under synthetic network setup. Introduces dynamic degree to classify environments and uses throughput as a guideline metric, validated on real networks.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12391
- Venue
- VLDB
- Year
- 2021
- Pagerank
- 5.0417258e-05
- Overall Rank
- 6,494 | 54.83%
- DOI
-
10.14778/3476249.3476267
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 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.00030040036 |
| 376 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00025097452 |
| 433 |
Scalable Network Distance Browsing in Spatial Databases |
2008 |
SIGMOD |
0.00023310419 |
| 945 |
Path Oracles for Spatial Networks |
2009 |
VLDB |
0.00015137526 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 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,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 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 |
| 1,892 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010185573 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,388 |
Anytime Stochastic Routing with Hybrid Learning |
2020 |
VLDB |
8.9132902e-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 |
| 3,164 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4543722e-05 |
| 4,111 |
Effective Caching of Shortest Paths for Location-Based Services |
2012 |
SIGMOD |
6.4427171e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 4,542 |
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks |
2020 |
SIGMOD |
6.1019408e-05 |
| 5,250 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.6044961e-05 |
| 7,236 |
Toward a Distance Oracle for Billion-Node Graphs |
2014 |
VLDB |
4.7932355e-05 |
| 8,967 |
Planting Trees for scalable and efficient Canonical Hub Labeling |
2020 |
VLDB |
4.4190656e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,078 |
Continuously Monitoring Alternative Shortest Paths on Road Networks |
2020 |
VLDB |
4.400728e-05 |
| 8,907 |
Shortest Paths Discovery in Uncertain Networks via Transfer Learning |
2023 |
SIGMOD |
4.427232e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 1,892 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010185573 |
| 6,171 |
Shortest Paths and Centrality in Uncertain Networks |
2021 |
VLDB |
5.170101e-05 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 4,430 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.1942479e-05 |
| 4,973 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7909705e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 4,542 |
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks |
2020 |
SIGMOD |
6.1019408e-05 |