"A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point ..."

Jayadev Misra (2001)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(00)00202-7

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Misra01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Misra01
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.