A decomposition algorithm for shortest paths in a network with many strongly connected components

Peter Brucker. A decomposition algorithm for shortest paths in a network with many strongly connected components. Math. Meth. of OR, 18(5):177-180, 1974. [doi]

Abstract

Abstract is missing.