Dijkstra's algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dijkstra's algorithm" in English language version.

refsWebsite

Global rank English rank

16doi.org

2^nd place

11semanticscholar.org

11^th place

8^th place

3arxiv.org

69^th place

59^th place

3web.archive.org

1^st place

1infona.pl

low place

1acm.org

1,185^th place

840^th place

1cwi.nl

low place

1psu.edu

207^th place

136^th place

1mpg.de

1,624^th place

1,592^nd place

1gwdg.de

low place

1aaai.org

9,352^nd place

5,696^th place

1tue.nl

9,054^th place

6,363^rd place

1utexas.edu

916^th place

706^th place

1harvard.edu

18^th place

17^th place

1ict.ac.cn

low place

1stackexchange.com

1,983^rd place

1,330^th place

1sunysb.edu

9,785^th place

9,347^th place

1umd.edu

1,747^th place

1,277^th place

1kit.edu

6,505^th place

9,776^th place

1ucl.ac.uk

1,306^th place

885^th place

1quantamagazine.org

6,413^th place

4,268^th place

1mit.edu

415^th place

327^th place

1handle.net

102^nd place

76^th place

1icm.edu.pl

2,656^th place

5,310^th place

1unimelb.edu.au

3,221^st place

2,222^nd place

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

Felner, Ariel (2011). Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. Proc. 4th Int'l Symp. on Combinatorial Search. Archived from the original on 18 February 2020. Retrieved 12 February 2015. In a route-finding problem, Felner finds that the queue can be a factor 500–600 smaller, taking some 40% of the running time.

acm.org (Global: 1,185^th place; English: 840^th place)

amturing.acm.org

Richards, Hamilton. "Edsger Wybe Dijkstra". A.M. Turing Award. Association for Computing Machinery. Retrieved 16 October 2017. At the Mathematical Centre a major project was building the ARMAC computer. For its official inauguration in 1956, Dijkstra devised a program to solve a problem interesting to a nontechnical audience: Given a network of roads connecting cities, what is the shortest route between two designated cities?

arxiv.org (Global: 69^th place; English: 59^th place)

Szcześniak, Ireneusz; Jajszczyk, Andrzej; Woźna-Szcześniak, Bożena (2019). "Generic Dijkstra for optical networks". Journal of Optical Communications and Networking. 11 (11): 568–577. arXiv:1810.04481. doi:10.1364/JOCN.11.000568. S2CID 52958911.
Szcześniak, Ireneusz; Woźna-Szcześniak, Bożena (2023), "Generic Dijkstra: Correctness and tractability", NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium, pp. 1–7, arXiv:2204.13547, doi:10.1109/NOMS56928.2023.10154322, ISBN 978-1-6654-7716-1, S2CID 248427020
Haeupler, Bernhard; Hladík, Richard; Rozhoň, Václav; Tarjan, Robert; Tětek, Jakub (28 October 2024). "Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps". arXiv:2311.11793 [cs.DS].

cwi.nl (Global: low place; English: low place)

ir.cwi.nl

Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. CiteSeerX 10.1.1.165.7577. doi:10.1007/BF01386390. S2CID 123284777.

doi.org (Global: 2^nd place; English: 2^nd place)

Fredman & Tarjan 1987. Fredman, Michael Lawrence; Tarjan, Robert E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the Association for Computing Machinery. 34 (3): 596–615. doi:10.1145/28869.28874. S2CID 7904683.
Frana, Phil (August 2010). "An Interview with Edsger W. Dijkstra". Communications of the ACM. 53 (8): 41–47. doi:10.1145/1787234.1787249. S2CID 27009702.
Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. CiteSeerX 10.1.1.165.7577. doi:10.1007/BF01386390. S2CID 123284777.
Mehlhorn, Kurt; Sanders, Peter (2008). "Chapter 10. Shortest Paths" (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.
Schrijver, Alexander (2012). "On the history of the shortest path problem" (PDF). Optimization Stories. Documenta Mathematica Series. Vol. 6. pp. 155–167. doi:10.4171/dms/6/19. ISBN 978-3-936609-58-5.
Szcześniak, Ireneusz; Jajszczyk, Andrzej; Woźna-Szcześniak, Bożena (2019). "Generic Dijkstra for optical networks". Journal of Optical Communications and Networking. 11 (11): 568–577. arXiv:1810.04481. doi:10.1364/JOCN.11.000568. S2CID 52958911.
Szcześniak, Ireneusz; Woźna-Szcześniak, Bożena (2023), "Generic Dijkstra: Correctness and tractability", NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium, pp. 1–7, arXiv:2204.13547, doi:10.1109/NOMS56928.2023.10154322, ISBN 978-1-6654-7716-1, S2CID 248427020
Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.
Gass, Saul; Fu, Michael (2013). "Dijkstra's Algorithm". In Gass, Saul I; Fu, Michael C (eds.). Encyclopedia of Operations Research and Management Science. Vol. 1. Springer. doi:10.1007/978-1-4419-1153-7. ISBN 978-1-4419-1137-7 – via Springer Link.
Fredman & Tarjan 1984. Fredman, Michael Lawrence; Tarjan, Robert E. (1984). Fibonacci heaps and their uses in improved network optimization algorithms. 25th Annual Symposium on Foundations of Computer Science. IEEE. pp. 338–346. doi:10.1109/SFCS.1984.715934.
Sometimes also least-cost-first search: Nau, Dana S. (1983). "Expert computer systems" (PDF). Computer. 16 (2). IEEE: 63–85. doi:10.1109/mc.1983.1654302. S2CID 7301753.
Bauer, Reinhard; Delling, Daniel; Sanders, Peter; Schieferdecker, Dennis; Schultes, Dominik; Wagner, Dorothea (2010). "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm". ACM Journal of Experimental Algorithmics. 15: 2.1. doi:10.1145/1671970.1671976. S2CID 1661292.
Dial 1969. Dial, Robert B. (1969). "Algorithm 360: Shortest-path forest with topological ordering [H]". Communications of the ACM. 12 (11): 632–633. doi:10.1145/363269.363610. S2CID 6754003.
Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.
Thorup 2000. Thorup, Mikkel (2000). "On RAM priority Queues". SIAM Journal on Computing. 30 (1): 86–109. doi:10.1137/S0097539795288246. S2CID 5221089.
Raman 1997. Raman, Rajeev (1997). "Recent results on the single-source shortest paths problem". SIGACT News. 28 (2): 81–87. doi:10.1145/261342.261352. S2CID 18031586.

gwdg.de (Global: low place; English: low place)

ftp.gwdg.de

Schrijver, Alexander (2012). "On the history of the shortest path problem" (PDF). Optimization Stories. Documenta Mathematica Series. Vol. 6. pp. 155–167. doi:10.4171/dms/6/19. ISBN 978-3-936609-58-5.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.

icm.edu.pl (Global: 2,656^th place; English: 5,310^th place)

matwbn.icm.edu.pl

Sniedovich, M. (2006). "Dijkstra's algorithm revisited: the dynamic programming connexion" (PDF). Journal of Control and Cybernetics. 35 (3): 599–620. Online version of the paper with interactive computational modules.

ict.ac.cn (Global: low place; English: low place)

bioinfo.ict.ac.cn

Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.

infona.pl (Global: low place; English: low place)

Controversial, see Moshe Sniedovich (2006). "Dijkstra's algorithm revisited: the dynamic programming connexion". Control and Cybernetics. 35: 599–620. and below part.

kit.edu (Global: 6,505^th place; English: 9,776^th place)

publikationen.bibliothek.kit.edu

Bauer, Reinhard; Delling, Daniel; Sanders, Peter; Schieferdecker, Dennis; Schultes, Dominik; Wagner, Dorothea (2010). "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm". ACM Journal of Experimental Algorithmics. 15: 2.1. doi:10.1145/1671970.1671976. S2CID 1661292.

mit.edu (Global: 415^th place; English: 327^th place)

dspace.mit.edu

Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.

mpg.de (Global: 1,624^th place; English: 1,592^nd place)

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). "Chapter 10. Shortest Paths" (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. CiteSeerX 10.1.1.165.7577. doi:10.1007/BF01386390. S2CID 123284777.

quantamagazine.org (Global: 6,413^th place; English: 4,268^th place)

Brubaker, Ben (25 October 2024). "Computer Scientists Establish the Best Way to Traverse a Graph". Quanta Magazine. Retrieved 9 December 2024.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Fredman & Tarjan 1987. Fredman, Michael Lawrence; Tarjan, Robert E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the Association for Computing Machinery. 34 (3): 596–615. doi:10.1145/28869.28874. S2CID 7904683.
Frana, Phil (August 2010). "An Interview with Edsger W. Dijkstra". Communications of the ACM. 53 (8): 41–47. doi:10.1145/1787234.1787249. S2CID 27009702.
Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. CiteSeerX 10.1.1.165.7577. doi:10.1007/BF01386390. S2CID 123284777.
Szcześniak, Ireneusz; Jajszczyk, Andrzej; Woźna-Szcześniak, Bożena (2019). "Generic Dijkstra for optical networks". Journal of Optical Communications and Networking. 11 (11): 568–577. arXiv:1810.04481. doi:10.1364/JOCN.11.000568. S2CID 52958911.
Szcześniak, Ireneusz; Woźna-Szcześniak, Bożena (2023), "Generic Dijkstra: Correctness and tractability", NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium, pp. 1–7, arXiv:2204.13547, doi:10.1109/NOMS56928.2023.10154322, ISBN 978-1-6654-7716-1, S2CID 248427020
Sometimes also least-cost-first search: Nau, Dana S. (1983). "Expert computer systems" (PDF). Computer. 16 (2). IEEE: 63–85. doi:10.1109/mc.1983.1654302. S2CID 7301753.
Bauer, Reinhard; Delling, Daniel; Sanders, Peter; Schieferdecker, Dennis; Schultes, Dominik; Wagner, Dorothea (2010). "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm". ACM Journal of Experimental Algorithmics. 15: 2.1. doi:10.1145/1671970.1671976. S2CID 1661292.
Dial 1969. Dial, Robert B. (1969). "Algorithm 360: Shortest-path forest with topological ordering [H]". Communications of the ACM. 12 (11): 632–633. doi:10.1145/363269.363610. S2CID 6754003.
Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.
Thorup 2000. Thorup, Mikkel (2000). "On RAM priority Queues". SIAM Journal on Computing. 30 (1): 86–109. doi:10.1137/S0097539795288246. S2CID 5221089.
Raman 1997. Raman, Rajeev (1997). "Recent results on the single-source shortest paths problem". SIGACT News. 28 (2): 81–87. doi:10.1145/261342.261352. S2CID 18031586.

stackexchange.com (Global: 1,983^rd place; English: 1,330^th place)

cs.stackexchange.com

Observe that p < dist[u] cannot ever hold because of the update dist[v] ← alt when updating the queue. See https://cs.stackexchange.com/questions/118388/dijkstra-without-decrease-key for discussion.

sunysb.edu (Global: 9,785^th place; English: 9,347^th place)

cs.sunysb.edu

Chen, M.; Chowdhury, R. A.; Ramachandran, V.; Roche, D. L.; Tong, L. (2007). Priority Queues and Dijkstra's Algorithm – UTCS Technical Report TR-07-54 – 12 October 2007 (PDF). Austin, Texas: The University of Texas at Austin, Department of Computer Sciences.

tue.nl (Global: 9,054^th place; English: 6,363^rd place)

www-set.win.tue.nl

"ARMAC". Unsung Heroes in Dutch Computing History. 2007. Archived from the original on 13 November 2013.

ucl.ac.uk (Global: 1,306^th place; English: 885^th place)

homepages.ucl.ac.uk

Thomas, Mark (30 May 2020). "Bidirectional Dijkstra". UCL Mathematics Blog. Retrieved 3 October 2025.

umd.edu (Global: 1,747^th place; English: 1,277^th place)

cs.umd.edu

Sometimes also least-cost-first search: Nau, Dana S. (1983). "Expert computer systems" (PDF). Computer. 16 (2). IEEE: 63–85. doi:10.1109/mc.1983.1654302. S2CID 7301753.

unimelb.edu.au (Global: 3,221^st place; English: 2,222^nd place)

ifors.ms.unimelb.edu.au

Sniedovich, M. (2006). "Dijkstra's algorithm revisited: the dynamic programming connexion" (PDF). Journal of Control and Cybernetics. 35 (3): 599–620. Online version of the paper with interactive computational modules.

utexas.edu (Global: 916^th place; English: 706^th place)

cs.utexas.edu

Dijkstra, Edsger W., Reflections on "A note on two problems in connexion with graphs (PDF)

web.archive.org (Global: 1^st place; English: 1^st place)

Felner, Ariel (2011). Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. Proc. 4th Int'l Symp. on Combinatorial Search. Archived from the original on 18 February 2020. Retrieved 12 February 2015. In a route-finding problem, Felner finds that the queue can be a factor 500–600 smaller, taking some 40% of the running time.
"ARMAC". Unsung Heroes in Dutch Computing History. 2007. Archived from the original on 13 November 2013.
Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.

Dijkstra's algorithm (English Wikipedia)

aaai.org (Global: 9,352nd place; English: 5,696th place)

acm.org (Global: 1,185th place; English: 840th place)

amturing.acm.org

arxiv.org (Global: 69th place; English: 59th place)

cwi.nl (Global: low place; English: low place)

ir.cwi.nl

doi.org (Global: 2nd place; English: 2nd place)

gwdg.de (Global: low place; English: low place)

ftp.gwdg.de

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

icm.edu.pl (Global: 2,656th place; English: 5,310th place)

matwbn.icm.edu.pl

ict.ac.cn (Global: low place; English: low place)

bioinfo.ict.ac.cn

infona.pl (Global: low place; English: low place)

kit.edu (Global: 6,505th place; English: 9,776th place)

publikationen.bibliothek.kit.edu

mit.edu (Global: 415th place; English: 327th place)

dspace.mit.edu

mpg.de (Global: 1,624th place; English: 1,592nd place)

people.mpi-inf.mpg.de

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

quantamagazine.org (Global: 6,413th place; English: 4,268th place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

stackexchange.com (Global: 1,983rd place; English: 1,330th place)

cs.stackexchange.com

sunysb.edu (Global: 9,785th place; English: 9,347th place)

cs.sunysb.edu

tue.nl (Global: 9,054th place; English: 6,363rd place)

www-set.win.tue.nl

ucl.ac.uk (Global: 1,306th place; English: 885th place)

homepages.ucl.ac.uk

umd.edu (Global: 1,747th place; English: 1,277th place)

cs.umd.edu

unimelb.edu.au (Global: 3,221st place; English: 2,222nd place)

ifors.ms.unimelb.edu.au

utexas.edu (Global: 916th place; English: 706th place)

cs.utexas.edu

web.archive.org (Global: 1st place; English: 1st place)

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

acm.org (Global: 1,185^th place; English: 840^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

handle.net (Global: 102^nd place; English: 76^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

icm.edu.pl (Global: 2,656^th place; English: 5,310^th place)

kit.edu (Global: 6,505^th place; English: 9,776^th place)

mit.edu (Global: 415^th place; English: 327^th place)

mpg.de (Global: 1,624^th place; English: 1,592^nd place)

psu.edu (Global: 207^th place; English: 136^th place)

quantamagazine.org (Global: 6,413^th place; English: 4,268^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

stackexchange.com (Global: 1,983^rd place; English: 1,330^th place)

sunysb.edu (Global: 9,785^th place; English: 9,347^th place)

tue.nl (Global: 9,054^th place; English: 6,363^rd place)

ucl.ac.uk (Global: 1,306^th place; English: 885^th place)

umd.edu (Global: 1,747^th place; English: 1,277^th place)

unimelb.edu.au (Global: 3,221^st place; English: 2,222^nd place)

utexas.edu (Global: 916^th place; English: 706^th place)

web.archive.org (Global: 1^st place; English: 1^st place)