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

DOI10.1287/MNSC.14.1.19MaRDI QIDQ5574560zbMATH OpenOpenAlexFDO

Authors B. A. Farbey, Ailsa Land, John D. Murchland

Publication date 1967

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.14.1.19

zbMATH Keywords

operations research

Cited in

(7)

• Allowable processing orders in the accelerated cascade algorithm
• Large-scale network analysis with applications to transportation, communication and inference networks
• Ein reduzierter Matrix-Algorithmus zur Lösung einiger graphentheoretischer Probleme. (A reduced matrix algorithm for solving some graph-theoretical systems.)
• Symbolic expression of transfer functions in compartmental systems with control
• Some optimal path problems subject to improvements
• Shortest-path queries in static networks
• Some constrained shortest-route problems

This page was built for publication: The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5574560)