Finding Shortest Paths in Very Large Networks

Eugene L. Lawler, Michael George Luby, B. Parker. Finding Shortest Paths in Very Large Networks. In Manfred Nagl, Jürgen Perl, editors, Proceedings WG 83, Workshop on Graphtheoretic Concepts in Computer Science, Haus Ohrbeck (near Osnabrück), Germany. pages 184-199, Trauner, Linz, 1983.

Abstract

Abstract is missing.