Y Deng, Y Chen, Y Zhang, S Mahadevan - Applied Soft Computing, 2012 - Elsevier

… Elsevier. Applied Soft Computing. Volume 12, Issue 3, March 2012, Pages 1231-1237.
Applied Soft Computing. Short communication. Fuzzy Dijkstra algorithm for shortest path
problem under uncertain environment … 2.3. Dijkstra algorithm … 
‫كلها‬8 ‫مقاالت? ذات صلةاإلصدارات الـ‬225 :‫تم اقتباسها في عدد‬
      

Dijkstra's shortest path algorithm serial and parallel execution

performance analysis
N Jasika, N Alispahic, A Elma, K Ilvana… - 2012 proceedings of …, 2012 - ieeexplore.ieee.org
… By putting some constraints on the data and taking the advantage of the hardware, the
performance of the algorithms can be significantly improved. In this article, firstly you can find
a definition of the Dijkstra's algorithm for computing single-source shortest path in a graph, and … 
‫كلها‬3 ‫مقاالت? ذات صلةاإلصدارات الـ‬103 :‫تم اقتباسها في عدد‬
      

[PDF] academia.edu
Applying Dijkstra algorithm for solving neutrosophic shortest path
problem
S Broumi, A Bakal, M Talea… - 2016 International …, 2016 - ieeexplore.ieee.org
… One of common algorithms in solving shortest path problem is Dijkstra's algorithm. In this paper,
Dijkstra's algorithm has been redesigned to handle the case in which most of parameters of
a network are uncertain and given in terms of neutrosophic numbers … 
‫كلها‬8 ‫مقاالت? ذات صلةاإلصدارات الـ‬98 :‫تم اقتباسها في عدد‬
      

[PDF] acm.org
A note on Dijkstra's shortest path algorithm
DB Johnson - Journal of the ACM (JACM), 1973 - dl.acm.org
… not affect the main results of the paper cited, it is important to notice that the modified Dijkstra's
algorithm can be a poor choice in the general case, altho