This is a preview of subscription content, log in via an institution to check access.
Literature Cited
N. Deo, C. Y. Pang, and R. E. Lord, “Two parallel algorithms for shortest path problems,” Proc. Int. Conf. Parallel Processes, ACM, New York (1980), pp. 244–253.
E. A. Ivanov and V. P. Shevchenko, “On parallel computations on graphs,” Kibernetika, No. 3, 89–94 (1984).
E. Dijkstra, “A note on two problems in connection with graphs,” Numer. Math., No. 1, 269–271 (1959).
E. F. Moore, “The shortest paths through a maze,” Proc. Int. Symp. Theory Switch, IEEE, New York (1957), pp. 285–292.
M. Pollack, “Solutions of the shortest-route problems — a review,” Op. Res., No. 8, 224–230 (1960).
U. Pape, “Implementation and efficiency of Moore-algorithms for the shortest-route problems,” Math. Progr., No. 7, 212–222 (1974).
A. A. Bakaev, S. V. Branovitskaya, V. S. Mikhalevich, and N. Z. Shor, “Determining the characteristics of a transportation network by the method of successive analysis of alternatives,” Dokl. AN UkrSSR, No. 4, 469–472 (1962).
Additional information
Translated from Kibernetika, No. 3, pp. 57–60, May–June, 1986.
Rights and permissions
About this article
Cite this article
Anisimov, A.V. A local algorithm for the shortest path problem with a single source. Cybern Syst Anal 22, 327–332 (1986). https://doi.org/10.1007/BF01069971
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069971