Geodesic
The algorithm for determining the shortest path in a network graph
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 11 (1971) no. 4, pp. 1078-1086 
S. M. Alekseeva; O. G. Alekseev. The algorithm for determining the shortest path in a network graph. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 11 (1971) no. 4, pp. 1078-1086. http://geodesic.mathdoc.fr/item/ZVMMF_1971_11_4_a29/
@article{ZVMMF_1971_11_4_a29,
     author = {S. M. Alekseeva and O. G. Alekseev},
     title = {The algorithm for determining the shortest path in a network graph},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1078--1086},
     year = {1971},
     volume = {11},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1971_11_4_a29/}
}
TY  - JOUR
AU  - S. M. Alekseeva
AU  - O. G. Alekseev
TI  - The algorithm for determining the shortest path in a network graph
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1971
SP  - 1078
EP  - 1086
VL  - 11
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1971_11_4_a29/
LA  - ru
ID  - ZVMMF_1971_11_4_a29
ER  - 
%0 Journal Article
%A S. M. Alekseeva
%A O. G. Alekseev
%T The algorithm for determining the shortest path in a network graph
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1971
%P 1078-1086
%V 11
%N 4
%U http://geodesic.mathdoc.fr/item/ZVMMF_1971_11_4_a29/
%G ru
%F ZVMMF_1971_11_4_a29

Voir la notice de l'article provenant de la source Math-Net.Ru