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

DOI10.1016/S0020-0190(00)00202-7zbMATH Open1050.68166OpenAlexW1994777125WikidataQ127632613 ScholiaQ127632613MaRDI QIDQ1607102FDOQ1607102

Authors: 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

Recommendations

• An Appraisal of Some Shortest-Path Algorithms
• Shortest paths algorithms: Theory and experimental evaluation
• scientific article; zbMATH DE number 1003284
• scientific article; zbMATH DE number 5152602
• A theorem on the expected complexity of dijkstra's shortest path algorithm
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Computing almost shortest paths (extended abstract)
• The shortest-path problem. Analysis and comparison of methods
• Algorithms for path optimizations: a short survey
• Shortest-path algorithms: Taxonomy and annotation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on two problems in connexion with graphs

Cited In (4)

• The shortest path in parallel
• Dijkstra, Floyd and Warshall meet Kleene
• Calculating graph algorithms for dominance and shortest path
• Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment

Uses Software

• UNITY

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607102)