Jayadev Misra. A walk over the shortest path: Dijkstra s Algorithm viewed as fixed-point computation. Inf. Process. Lett., 77(2-4):197-200, 2001. [doi]
@article{Misra01,
title = {A walk over the shortest path: Dijkstra s Algorithm viewed as fixed-point computation},
author = {Jayadev Misra},
year = {2001},
doi = {10.1016/S0020-0190(00)00202-7},
url = {http://dx.doi.org/10.1016/S0020-0190(00)00202-7},
researchr = {https://researchr.org/publication/Misra01},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {77},
number = {2-4},
pages = {197-200},
}