Algorithms 17-18. The shortest paths from a fixed node in a network
Applicationes Mathematicae (1972)
- Volume: 13, Issue: 2, page 275-282
- ISSN: 1233-7234
Access Full Article
top
How to cite
topM. Sysło. "Algorithms 17-18. The shortest paths from a fixed node in a network." Applicationes Mathematicae 13.2 (1972): 275-282. <http://eudml.org/doc/267768>.
@article{M1972,
author = {M. Sysło},
journal = {Applicationes Mathematicae},
language = {eng},
number = {2},
pages = {275-282},
title = {Algorithms 17-18. The shortest paths from a fixed node in a network},
url = {http://eudml.org/doc/267768},
volume = {13},
year = {1972},
}
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
VL - 13
IS - 2
SP - 275
EP - 282
LA - eng
UR - http://eudml.org/doc/267768
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.