A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK.

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1967
Accession Number
AD0662730

Entities

People

  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computers
  • Decomposition
  • Mathematical Analysis
  • Mathematics

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.