The complexity of the characterization of networks supporting shortest-path interval routing.
Tamar EilamShlomo MoranShmuel ZaksPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- shortest path
- path selection
- routing algorithm
- path length
- shortest path problem
- source node
- road network
- betweenness centrality
- routing problem
- optimal path
- shortest path algorithm
- weighted graph
- dijkstra algorithm
- edge weights
- flow graph
- network resources
- path queries
- finding the shortest path
- network structure
- complex networks
- network topologies
- social networks
- geodesic distance
- travel time
- minimum length
- minimum spanning tree
- cellular networks
- shortest distance