The Extension of the Cascade Algorithm to Large Graphs

A. H. Land and S. W. Stairs
Additional contact information
A. H. Land: London School of Economics
S. W. Stairs: London Graduate School of Business Studies

Management Science, 1967, vol. 14, issue 1, 29-33

Abstract: Large graphs for which the calculation of the shortest distances between all vertices is required often consist of several parts with limited interconnections. This paper shows how this characteristic may be used to reduce computer storage for a matrix type calculation, to reduce calculations] labour, and to provide results in a form which is particularly convenient if a subsequent assignment of commodity flow to shortest paths is needed. The technique presented here allows the partition to be arbitrary, save for a single, easily achieved, condition.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.14.1.29 (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:ormnsc:v:14:y:1967:i:1:p:29-33

Access Statistics for this article

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