The following publications are possibly variants of this publication:
- Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain GraphsYe Yuan, Lei Chen 0002, Guoren Wang. dasfaa 2010: 155-170 [doi]
- Querying Shortest Path Distance with Bounded Errors in Large GraphsMiao Qiao, Hong Cheng, Jeffrey Xu Yu. ssdbm 2011: 255-273 [doi]
- Efficient Sampling Methods for Shortest Path Query over Uncertain GraphsYurong Cheng, Ye Yuan, Guoren Wang, Baiyou Qiao, Zhiqiong Wang. dasfaa 2014: 124-140 [doi]
- Shortest path queries in planar graphsDanny Z. Chen, Jinhui Xu. stoc 2000: 469-478 [doi]
- Fast shortest-path queries on large-scale graphsQiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, Tilman Wolf. icnp 2016: 1-10 [doi]