A Decomposition Algorithm for Shortest Paths in a Network

T. C. Hu
Additional contact information
T. C. Hu: The University of Wisconsin, Madison, Wisconsin

Operations Research, 1968, vol. 16, issue 1, 91-102

Abstract: Given an 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.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.1.91 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:1:p:91-102

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().