A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
type: Item
instance of: scholarly article
title: A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
zbMATH Open document ID: 1050.68166
DOI: 10.1016/S0020-0190(00)00202-7
author: Jayadev Misra
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1771803
describes a project that uses: UNITY
MaRDI profile type: Publication
cites work: Q4692502
cites work: A note on two problems in connexion with graphs
Wikidata QID: Q127632613
full work available at URL: s0020-0190(00)00202-7
OpenAlex ID: W1994777125
Recommended article: An Appraisal of Some Shortest-Path Algorithms
Recommended article: Shortest paths algorithms: Theory and experimental evaluation
Recommended article: Q3128914
Recommended article: Q3437244
Recommended article: A theorem on the expected complexity of dijkstra's shortest path algorithm
Recommended article: Computing the shortest path: \(A^\ast\) search meets graph theory
Recommended article: Computing almost shortest paths (extended abstract)
Recommended article: The Shortest-Path Problem: Analysis and Comparison of Methods
Recommended article: Algorithms for path optimizations: a short survey
Recommended article: Shortest-path algorithms: Taxonomy and annotation
description: scientific article; zbMATH DE number 1771803