Geodesic
Algorithms 17-18. The shortest paths from a fixed node in a network
Applicationes Mathematicae, Tome 13 (1972) no. 2, pp. 275-282.

Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences

DOI : 10.4064/am-13-2-275-282

M. Sysło 1

1 
@article{10_4064_am_13_2_275_282,
     author = {M. Sys{\l}o},
     title = {Algorithms 17-18. {The} shortest paths from a fixed node in a network},
     journal = {Applicationes Mathematicae},
     pages = {275--282},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {1972},
     doi = {10.4064/am-13-2-275-282},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4064/am-13-2-275-282/}
}
TY  - JOUR
AU  - M. Sysło
TI  - Algorithms 17-18. The shortest paths from a fixed node in a network
JO  - Applicationes Mathematicae
PY  - 1972
SP  - 275
EP  - 282
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4064/am-13-2-275-282/
DO  - 10.4064/am-13-2-275-282
LA  - en
ID  - 10_4064_am_13_2_275_282
ER  - 
%0 Journal Article
%A M. Sysło
%T Algorithms 17-18. The shortest paths from a fixed node in a network
%J Applicationes Mathematicae
%D 1972
%P 275-282
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4064/am-13-2-275-282/
%R 10.4064/am-13-2-275-282
%G en
%F 10_4064_am_13_2_275_282
M. Sysło. Algorithms 17-18. The shortest paths from a fixed node in a network. Applicationes Mathematicae, Tome 13 (1972) no. 2, pp. 275-282. doi : 10.4064/am-13-2-275-282. http://geodesic.mathdoc.fr/articles/10.4064/am-13-2-275-282/

Cité par Sources :