Probabilistic Shortest Paths
Probabilistic Shortest Paths is a shortest path framework that models edge weights or path existence as random variables, incorporating uncertainty into the computation of shortest paths through probabilistic analysis.
45
Publications
2.5K
Citations
117
Authors
69
Institutions
Publications per year
2017–2026
13
Parents
45
Shortest Paths in Probabilistic Graphs
H. Frank · Operations Research · 1969 · 351 citations
Finding Reliable Shortest Paths in Road Networks Under Uncertainty
Bi Yu Chen, William H. K. Lam, Agachai Sumalee et al. · Networks and Spatial Economics · 2012 · 147 citations
Probabilistic path queries in road networks
1–5 of 45
117
Hong Kong Polytechnic University, Hong Kong SAR China
3 publications · 231 citations
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 117
69
Rensselaer Polytechnic Institute
Troy, United States
3 h-index
6 publications
612 citations
The University of Texas at Austin
Austin, United States
3 h-index
6 publications
134 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
3 h-index
5 publications
525 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
5 publications
275 citations
State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing
Wuhan, China
2 h-index
5 publications
565 citations
China University of Mining and Technology
Xuzhou, China
2 h-index
2 publications
169 citations

Beihang University
Beijing, China
2 h-index
8 publications
348 citations
Wuhan University
Wuhan, China
2 h-index
5 publications
565 citations
1–8 of 69
3 publications · 165 citations
3
h-index
3 publications · 249 citations
3
h-index
3 publications · 398 citations
3
h-index
2 publications · 87 citations
2
h-index
2 publications · 51 citations
2
h-index
1–5