Shortest Path Cost Distribution in Random Graphs with Positive Integer Edge Costs.
Scott K. WalleyHarry H. TanAudrey M. ViterbiPublished in: INFOCOM (1993)
Keyphrases
- shortest path
- undirected graph
- positive integer
- random graphs
- minimum cost
- path length
- weighted graph
- edge weights
- finding the shortest path
- directed graph
- shortest path problem
- spanning tree
- approximation algorithms
- shortest path algorithm
- road network
- graph structure
- connected components
- routing algorithm
- optimal path
- complex networks
- np hard
- directed acyclic graph
- power law
- random variables
- probability distribution
- phase transition
- flow graph
- graph theoretic
- travel time
- bayesian networks
- random walk
- lower bound