Accession Number : AD0662730

Title :   A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK.

Descriptive Note : Technical summary rept.,

Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER

Personal Author(s) : Hu,T. C.

Report Date : SEP 1967

Pagination or Media Count : 20

Abstract : 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 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. (Author)

Descriptors :   (*NETWORKS, MATHEMATICAL ANALYSIS), (*GRAPHICS, OPTIMIZATION), ALGORITHMS, MATRICES(MATHEMATICS), INEQUALITIES, SET THEORY, THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE