Shortest path problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Shortest path problem" in English language version.

Last modified: 23:30:37, 26 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1917doi.org

2^nd place

77worldcat.org

4^th place

65semanticscholar.org

15^th place

8^th place

55arxiv.org

49^th place

31^st place

32springer.com

182^nd place

172^nd place

22books.google.com

3^rd place

22quantamagazine.org

6,258^th place

4,046^th place

22ghostarchive.org

64^th place

28^th place

22microsoft.com

263^rd place

259^th place

11monash.edu

8,933^rd place

5,114^th place

11geeksforgeeks.org

low place

11nytimes.com

7^th place

11youtube.com

13^th place

14^th place

11adsabs.harvard.edu

14^th place

9^th place

11psu.edu

299^th place

159^th place

11aaai.org

low place

6,393^rd place

11hdl.handle.net

66^th place

34^th place

aaai.org (Global: low place; English: 6,393^rd place)

Nikolova, Evdokia; Karger, David R. "Route planning under uncertainty: the Canadian traveller problem" (PDF). Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI). pp. 969–974. Archived (PDF) from the original on 2022-10-09.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Kroger, Martin (2005). "Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems". Computer Physics Communications. 168 (3): 209–232. Bibcode:2005CoPhC.168..209K. doi:10.1016/j.cpc.2005.01.020.

arxiv.org (Global: 49^th place; English: 31^st place)

Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Mhalla, Mehdi (January 2006). "Quantum query complexity of some graph problems". SIAM Journal on Computing. 35 (6): 1310–1328. arXiv:quant-ph/0401091. doi:10.1137/050644719. ISSN 0097-5397. S2CID 14253494.
Khanna, Sanjeev; Song, Junkai (February 18, 2026). "An n^2+o(1) Time Algorithm for Single-Source Negative Weight Shortest Paths". arXiv:2602.16638 [cs.DS].
Dürr, C.; Høyer, P. (1996-07-18). "A Quantum Algorithm for Finding the Minimum". arXiv:quant-ph/9607014.
Nayebi, Aran; Williams, V. V. (2014-10-22). "Quantum algorithms for shortest paths problems in structured instances". arXiv:1410.6220 [quant-ph].
Osanlou, Kevin; Bursuc, Andrei; Guettier, Christophe; Cazenave, Tristan; Jacopin, Eric (2019). "Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search". 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3519–3525. arXiv:2108.01036. doi:10.1109/IROS40897.2019.8968113. ISBN 978-1-7281-4004-9. S2CID 210706773.

books.google.com (Global: 3^rd place; English: 3^rd place)

Deo, Narsingh (17 August 2016). Graph Theory with Applications to Engineering and Computer Science. Courier Dover Publications. ISBN 978-0-486-80793-5.
Baras, John; Theodorakopoulos, George (4 April 2010). Path Problems in Networks. Morgan & Claypool Publishers. pp. 9–. ISBN 978-1-59829-924-3.

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

Ortega-Arranz, Hector; Llanos, Diego R.; Gonzalez-Escribano, Arturo (2015). The Shortest-Path Problem. Synthesis Lectures on Theoretical Computer Science. Cham: Springer. doi:10.1007/978-3-031-02574-7. ISBN 978-3-031-01446-8.
Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Mhalla, Mehdi (January 2006). "Quantum query complexity of some graph problems". SIAM Journal on Computing. 35 (6): 1310–1328. arXiv:quant-ph/0401091. doi:10.1137/050644719. ISSN 0097-5397. S2CID 14253494.
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.
Hoceini, S.; A. Mellouk; Y. Amirat (2005). "K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks". Networking - ICN 2005, Lecture Notes in Computer Science, Vol. 3421. Vol. 3421. Springer, Berlin, Heidelberg. pp. 164–172. doi:10.1007/978-3-540-31957-3_21. ISBN 978-3-540-25338-9.
Chen, Danny Z. (December 1996). "Developing algorithms and software for geometric path planning problems". ACM Computing Surveys. 28 (4es). Article 18. doi:10.1145/242224.242246. S2CID 11761485.
Kroger, Martin (2005). "Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems". Computer Physics Communications. 168 (3): 209–232. Bibcode:2005CoPhC.168..209K. doi:10.1016/j.cpc.2005.01.020.
Lozano, Leonardo; Medaglia, Andrés L (2013). "On an exact method for the constrained shortest path problem". Computers & Operations Research. 40 (1): 378–384. doi:10.1016/j.cor.2012.07.008.
Osanlou, Kevin; Bursuc, Andrei; Guettier, Christophe; Cazenave, Tristan; Jacopin, Eric (2019). "Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search". 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3519–3525. arXiv:2108.01036. doi:10.1109/IROS40897.2019.8968113. ISBN 978-1-7281-4004-9. S2CID 210706773.
Cherkassky, Boris V.; Goldberg, Andrew V. (1999-06-01). "Negative-cycle detection algorithms". Mathematical Programming. 85 (2): 277–311. doi:10.1007/s101070050058. ISSN 1436-4646. S2CID 79739.
Rajabi-Bahaabadi, Mojtaba; Shariat-Mohaymany, Afshin; Babaei, Mohsen; Ahn, Chang Wook (2015). "Multi-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm". Expert Systems with Applications. 42 (12): 5056–5064. doi:10.1016/j.eswa.2015.02.046.
Olya, Mohammad Hessam (2014). "Finding shortest path in a combined exponential – gamma probability distribution arc length". International Journal of Operational Research. 21 (1) 64020: 25–37. doi:10.1504/IJOR.2014.064020.
Olya, Mohammad Hessam (2014). "Applying Dijkstra's algorithm for general shortest path problem with normal probability distribution arc length". International Journal of Operational Research. 21 (2) 64541: 143–154. doi:10.1504/IJOR.2014.064541.
Hassin, Refael (February 1992). "Approximation Schemes for the Restricted Shortest Path Problem". Mathematics of Operations Research. 17 (1): 36–42. doi:10.1287/moor.17.1.36. ISSN 0364-765X.
Lorenz, Dean H.; Raz, Danny (June 2001). "A simple efficient approximation scheme for the restricted shortest path problem". Operations Research Letters. 28 (5): 213–219. doi:10.1016/s0167-6377(01)00069-4. ISSN 0167-6377.
Mehlhorn, Kurt; Ziegelmann, Mark (2000). "Resource Constrained Shortest Paths". In Paterson, Mike S. (ed.). Algorithms - ESA 2000. Lecture Notes in Computer Science. Vol. 1879. Berlin, Heidelberg: Springer. pp. 326–337. doi:10.1007/3-540-45253-2_30. ISBN 978-3-540-45253-9.
García-Heredia, David; Molina, Elisenda; Laguna, Manuel; Alonso-Ayuso, Antonio (November 2021). "A solution method for the shared resource-constrained multi-shortest path problem". Expert Systems with Applications. 182 115193. doi:10.1016/j.eswa.2021.115193. hdl:10016/30793. ISSN 0957-4174.
Handler, Gabriel Y.; Zang, Israel (December 1980). "A dual algorithm for the constrained shortest path problem". Networks. 10 (4): 293–309. doi:10.1002/net.3230100403. ISSN 0028-3045.

geeksforgeeks.org (Global: low place; English: low place)

"Shortest Path Algorithm Tutorial with Problems". GeeksforGeeks. 2023-11-02. Retrieved 2026-07-13.

ghostarchive.org (Global: 64^th place; English: 28^th place)

Sanders, Peter (March 23, 2009). "Fast route planning". Google Tech Talk. Archived from the original on 2021-12-11.
Nikolova, Evdokia; Karger, David R. "Route planning under uncertainty: the Canadian traveller problem" (PDF). Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI). pp. 969–974. Archived (PDF) from the original on 2022-10-09.

hdl.handle.net (Global: 66^th place; English: 34^th place)

García-Heredia, David; Molina, Elisenda; Laguna, Manuel; Alonso-Ayuso, Antonio (November 2021). "A solution method for the shared resource-constrained multi-shortest path problem". Expert Systems with Applications. 182 115193. doi:10.1016/j.eswa.2021.115193. hdl:10016/30793. ISSN 0957-4174.

microsoft.com (Global: 263^rd place; English: 259^th place)

research.microsoft.com

Abraham, Ittai; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F. "Highway Dimension, Shortest Paths, and Provably Efficient Algorithms". ACM-SIAM Symposium on Discrete Algorithms, pages 782–793, 2010.
Abraham, Ittai; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F. research.microsoft.com/pubs/142356/HL-TR.pdf "A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks". Symposium on Experimental Algorithms, pages 230–241, 2011.

monash.edu (Global: 8,933^rd place; English: 5,114^th place)

"Walks, trails, paths, cycles and circuits". Student Academic Success. Retrieved 2026-07-13.

nytimes.com (Global: 7^th place; English: 7^th place)

Kleinberg, Jon; Tardos, Éva (2005). Algorithm Design (1st ed.). Addison-Wesley. ISBN 978-0321295354.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Bar-Noy, Amotz; Schieber, Baruch (1991). "The canadian traveller problem". Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms: 261–270. CiteSeerX 10.1.1.1088.3015. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

quantamagazine.org (Global: 6,258^th place; English: 4,046^th place)

Brubaker, Ben (2025-08-06). "New Method Is the Fastest Way To Find the Best Routes". Quanta Magazine. Retrieved 2026-07-13.
Brubaker, Ben (2025-08-06). "New Method Is the Fastest Way To Find the Best Routes". Quanta Magazine. Retrieved 2025-08-11.

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

api.semanticscholar.org

Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Mhalla, Mehdi (January 2006). "Quantum query complexity of some graph problems". SIAM Journal on Computing. 35 (6): 1310–1328. arXiv:quant-ph/0401091. doi:10.1137/050644719. ISSN 0097-5397. S2CID 14253494.
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.
Chen, Danny Z. (December 1996). "Developing algorithms and software for geometric path planning problems". ACM Computing Surveys. 28 (4es). Article 18. doi:10.1145/242224.242246. S2CID 11761485.
Osanlou, Kevin; Bursuc, Andrei; Guettier, Christophe; Cazenave, Tristan; Jacopin, Eric (2019). "Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search". 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3519–3525. arXiv:2108.01036. doi:10.1109/IROS40897.2019.8968113. ISBN 978-1-7281-4004-9. S2CID 210706773.
Cherkassky, Boris V.; Goldberg, Andrew V. (1999-06-01). "Negative-cycle detection algorithms". Mathematical Programming. 85 (2): 277–311. doi:10.1007/s101070050058. ISSN 1436-4646. S2CID 79739.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Ortega-Arranz, Hector; Llanos, Diego R.; Gonzalez-Escribano, Arturo (2015). The Shortest-Path Problem. Synthesis Lectures on Theoretical Computer Science. Cham: Springer. doi:10.1007/978-3-031-02574-7. ISBN 978-3-031-01446-8.
Mehlhorn, Kurt; Ziegelmann, Mark (2000). "Resource Constrained Shortest Paths". In Paterson, Mike S. (ed.). Algorithms - ESA 2000. Lecture Notes in Computer Science. Vol. 1879. Berlin, Heidelberg: Springer. pp. 326–337. doi:10.1007/3-540-45253-2_30. ISBN 978-3-540-45253-9.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Mhalla, Mehdi (January 2006). "Quantum query complexity of some graph problems". SIAM Journal on Computing. 35 (6): 1310–1328. arXiv:quant-ph/0401091. doi:10.1137/050644719. ISSN 0097-5397. S2CID 14253494.
Cherkassky, Boris V.; Goldberg, Andrew V. (1999-06-01). "Negative-cycle detection algorithms". Mathematical Programming. 85 (2): 277–311. doi:10.1007/s101070050058. ISSN 1436-4646. S2CID 79739.
Pair, Claude (1967). "Sur des algorithmes pour des problèmes de cheminement dans les graphes finis" [On algorithms for path problems in finite graphs]. In Rosentiehl, Pierre (ed.). Théorie des graphes (journées internationales d'études) [Theory of Graphs (international symposium)]. Rome (Italy), July 1966. Dunod (Paris); Gordon and Breach (New York). p. 271. OCLC 901424694.
Hassin, Refael (February 1992). "Approximation Schemes for the Restricted Shortest Path Problem". Mathematics of Operations Research. 17 (1): 36–42. doi:10.1287/moor.17.1.36. ISSN 0364-765X.
Lorenz, Dean H.; Raz, Danny (June 2001). "A simple efficient approximation scheme for the restricted shortest path problem". Operations Research Letters. 28 (5): 213–219. doi:10.1016/s0167-6377(01)00069-4. ISSN 0167-6377.
García-Heredia, David; Molina, Elisenda; Laguna, Manuel; Alonso-Ayuso, Antonio (November 2021). "A solution method for the shared resource-constrained multi-shortest path problem". Expert Systems with Applications. 182 115193. doi:10.1016/j.eswa.2021.115193. hdl:10016/30793. ISSN 0957-4174.
Handler, Gabriel Y.; Zang, Israel (December 1980). "A dual algorithm for the constrained shortest path problem". Networks. 10 (4): 293–309. doi:10.1002/net.3230100403. ISSN 0028-3045.

youtube.com (Global: 13^th place; English: 14^th place)

Sanders, Peter (March 23, 2009). "Fast route planning". Google Tech Talk. Archived from the original on 2021-12-11.

Shortest path problem (English Wikipedia)

aaai.org (Global: low place; English: 6,393rd place)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

arxiv.org (Global: 49th place; English: 31st place)

books.google.com (Global: 3rd place; English: 3rd place)

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

geeksforgeeks.org (Global: low place; English: low place)

ghostarchive.org (Global: 64th place; English: 28th place)

hdl.handle.net (Global: 66th place; English: 34th place)

microsoft.com (Global: 263rd place; English: 259th place)