Dijkstra’s Algorithm Analysis
Dijkstra’s Algorithm Analysis is an academic concept in the field of algorithm analysis that refers to the systematic examination of the time and space complexity, correctness, and performance characteristics of Dijkstra’s shortest path algorithm under various computational models and data structures.
95
Publications
4.6K
Citations
231
Authors
104
Institutions
Publications per year
2017–2026
26
Parents
95
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
Yong Deng, Yuxin Chen, Yajuan Zhang et al. · Applied Soft Computing · 2011 · 456 citations
A Note on Dijkstra's Shortest Path Algorithm
D. Barton Johnson · Journal of the ACM · 1973 · 317 citations · Full text
Application of Dijkstra algorithm in robot path-planning
Huijuan Wang, Yuan Yu, Quanbo Yuan · 2011 · 245 citations
1–5 of 95
231
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 231
104
University of Bonn
Bonn, Germany
2 h-index
5 publications
270 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
2 h-index
7 publications
1.2K citations

University of Naples Federico II
Naples, Italy
1 h-index
1 publications
24 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
108 citations
The University of Texas at Austin
Austin, United States
1 h-index
1 publications
34 citations
Northeastern University
Boston, United States
1 h-index
5 publications
115 citations
University of Defence
Brno, Czechia
1 h-index
1 publications
36 citations
University of Osijek
Osijek, Croatia
1 h-index
1 publications
60 citations
1–8 of 104
JEA · 3 publications · 312 citations
3
h-index
3 publications · 83 citations
3
h-index
2 publications · 44 citations
2
h-index
2 publications · 128 citations
2
h-index
2 publications · 477 citations
2
h-index
1–5