ALL SHORTEST DISTANCES IN LARGE SERIAL NETWORKS,

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)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1970
Accession Number
AD0711959

Entities

People

  • John M. Burt Jr

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Chemical Reactions
  • Decomposition
  • Flow Network
  • Transportation

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.