Accession Number : AD0711959

Title :   ALL SHORTEST DISTANCES IN LARGE SERIAL NETWORKS,

Corporate Author : CALIFORNIA UNIV LOS ANGELES WESTERN MANAGEMENT SCIENCE INST

Personal Author(s) : Burt,John M. , Jr

Report Date : JUL 1970

Pagination or Media Count : 26

Abstract : The paper describes an algorithm for finding the shortest distances between all pairs of nodes in certain large networks. For highly 'serial' networks, i.e., those containing a substantial number of nodes connected to exactly two other nodes, the procedure is considerably more efficient than the traditional cascade algorithm -- decomposition method. Empirical results are given of an application of the algorithm to a large (357 nodes) urban transportation network. (Author)

Descriptors :   (*DIFFERENCE EQUATIONS, NETWORKS), (*NETWORKS, TRANSPORTATION), ALGORITHMS, MATHEMATICAL ANALYSIS, OPTIMIZATION

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE