-Cube network: node disjoint shortest paths for maximal distance pairs of vertices.
Teofilo F. GonzalezDavid SerenaPublished in: Parallel Comput. (2004)
Keyphrases
- shortest path
- path length
- shortest path algorithm
- network routing
- edge weights
- routing algorithm
- finding the shortest path
- node disjoint
- shortest distance
- weighted graph
- spatial networks
- geodesic distance
- source node
- multiple paths
- road network
- betweenness centrality
- minimum length
- complex networks
- multipath routing
- network resources
- multipath
- optimal solution
- network traffic
- real world networks
- wireless sensor networks
- directed graph
- euclidean distance