Walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation

Information Processing Letters

Volumn 77, Issue 2-4, 2001, Pages 197-200

  Misra, Jayadev ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL ALGORITHMS; PROBLEM SOLVING;

DIJKSTRA'S ALGORITHM; FIXED-POINT COMPUTATIONS;

DECISION THEORY;

EID: 0035247337     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00202-7     Document Type: Article

References (2)

1. Chandy K.M., Misra J. Parallel Program Design: A Foundation. 1988;Addison-Wesley, Reading, MA.
2. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1:1959;83-89.