Shortest paths in stochastic networks with ARC lengths having discrete distributions.
Gehan A. CoreaVidyadhar G. KulkarniPublished in: Networks (1993)
Keyphrases
- shortest path
- path length
- shortest path problem
- betweenness centrality
- shortest path algorithm
- power law
- routing algorithm
- spatial networks
- edge weights
- linear gaussian
- road network
- complex networks
- probability distribution
- flow graph
- social networks
- network design
- minimum length
- strongly connected components
- network analysis
- weighted graph
- geodesic distance
- optimal path
- small world
- travel time
- random variables
- shortest distance
- multi objective
- connected components
- network structure
- minimum cost flow
- random walk
- nearest neighbor
- finding the shortest path