A decomposition algorithm for locating a shortest path between two nodes in a network.
John J. JarvisSüleyman TüfekciPublished in: Networks (1982)
Keyphrases
- shortest path
- shortest path algorithm
- decomposition algorithm
- path length
- finding the shortest path
- dijkstra algorithm
- source node
- shortest path problem
- optimal path
- routing algorithm
- road network
- shortest distance
- decomposition method
- spatial networks
- path selection
- weighted graph
- edge weights
- network structure
- network traffic
- video sequences
- network routing
- wireless sensor networks
- working set
- minimal surface
- complex networks
- dynamic programming
- flow graph
- peer to peer
- action recognition
- social networks
- optimal solution