Algorithms 17-18. The shortest paths from a fixed node in a network
Applicationes Mathematicae, Tome 13 (1972) no. 2, pp. 275-282
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
@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},
year = {1972},
volume = {13},
number = {2},
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 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 -
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
Cité par Sources :