Limit Distributions for the Diameter and the Shortest Path Hop Count in Random Graphs with Positive Integer Edge Costs.
Scott K. WalleyHarry H. TanAudrey M. ViterbiPublished in: INFOCOM (1994)
Keyphrases
- shortest path
- undirected graph
- positive integer
- random graphs
- directed graph
- directed acyclic graph
- approximation algorithms
- spanning tree
- road network
- weighted graph
- hop count
- minimum cost
- complex networks
- connected components
- probability distribution
- routing algorithm
- power law
- graph structure
- edge weights
- multi hop
- travel time
- routing protocol
- binary images
- random variables
- random walk
- np complete
- level set
- web services