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

DOI10.1016/S0020-0190(00)00202-7zbMath1050.68166OpenAlexW1994777125WikidataQ127632613 ScholiaQ127632613MaRDI QIDQ1607102

Jayadev Misra

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00202-7

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ The shortest path in parallel

Uses Software

• UNITY

Cites Work

• A note on two problems in connexion with graphs
• Unnamed Item

This page was built for publication: A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.