A Decomposition Algorithm for Shortest Paths in a Network
暂无分享,去创建一个
Given an n-node network with lengths associated with arcs: the problem is to find the shortest paths between every pair of nodes in the network. If the network has less than n(n − 1) arcs, then it is possible to treat parts of the network at a time and then get the shortest paths between every pair of nodes. This decomposition algorithm saves the amount of computation as well as the storage requirement of a computer.
[1] Stephen J. Garland,et al. Algorithm 97: Shortest path , 1962, Commun. ACM.
[2] Claude Berge,et al. The theory of graphs and its applications , 1962 .
[3] G. Mills. A Decomposition Algorithm for the Shortest-Route Problem , 1966, Oper. Res..