A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation
Author:
- 28 February 2001
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 77 (2-4) , 197-200
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- A note on two problems in connexion with graphsNumerische Mathematik, 1959