A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
Given a 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 nn-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. Author
- Theoretical Mathematics