The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph

Matrix methods for finding shortest distances are convenient and efficient when the lengths of shortest paths are wanted between all pairs of vertices in a graph. The Cascade algorithm requires substantially fewer operations to find these distances than does the standard matrix method.

MoreLess

Year of publication:	1967
Authors:	Farbey, B. A. ; Land, A. H. ; Murchland, J. D.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 14.1967, 1, p. 19-28
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.14.1.19 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009196994