Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems.
Teofilo F. GonzalezDavid SerenaPublished in: IASTED PDCS (2002)
Keyphrases
- related problems
- shortest path
- pairwise
- shortest path algorithm
- path length
- spatial networks
- weighted graph
- finding the shortest path
- road network
- dijkstra algorithm
- routing algorithm
- network structure
- optimal path
- semi supervised
- similarity measure
- minimum cost flow
- wireless sensor networks
- communication networks
- shortest path problem
- information flow
- transportation networks
- geodesic distance
- travel time
- complex networks
- reinforcement learning