Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network

Jin Y. Yen
Additional contact information
Jin Y. Yen: Graduate School of Business, University of Santa Clara, Santa Clara, California

Operations Research, 1971, vol. 19, issue 4, 983-985

Abstract: Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this note is to point out how the efficiency of this algorithm can be improved by making a modification.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.983 (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:19:y:1971:i:4:p:983-985

Access Statistics for this article

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