%0 Journal Article %1 Dijkstra:ShortestPath %A Dijkstra, E. W. %D 1959 %I Springer Berlin / Heidelberg %J Numerische Mathematik %K article dijkstra path shortest %P 269-271 %T A note on two problems in connexion with graphs %U http://dx.doi.org/10.1007/BF01386390 %V 1

@article{Dijkstra:ShortestPath, added-at = {2011-08-17T16:08:47.000+0200}, affiliation = {Mathematisch Centrum 2e Boerhaavestraat 49 Amsterdam-O}, author = {Dijkstra, E. W.}, biburl = {https://www.bibsonomy.org/bibtex/2b9e4d731b2fb8f10e29724363a025cab/pcbouman}, interhash = {12a0919aa962021a0db8c0f7088d2279}, intrahash = {b9e4d731b2fb8f10e29724363a025cab}, issn = {0029-599X}, issue = {1}, journal = {Numerische Mathematik}, keyword = {Mathematics and Statistics}, keywords = {article dijkstra path shortest}, note = {10.1007/BF01386390}, pages = {269-271}, publisher = {Springer Berlin / Heidelberg}, timestamp = {2011-08-18T09:10:27.000+0200}, title = {A note on two problems in connexion with graphs}, url = {http://dx.doi.org/10.1007/BF01386390}, volume = 1, year = 1959 }