Among these, shortest path queries are instrumental in identifying the most efficient routes within a network, thereby reducing cost, time and resource consumption.

This is a preview. Log in through your library . Abstract We consider the shortest paths between all pairs of nodes in a directed or undirected complete graph with edge lengths which are uniformly and ...

This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes ...