Bellman–Ford algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bellman–Ford algorithm" in English language version.

Last modified: 19:21:52, 19 October 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

41rhul.ac.uk

low place

21stanford.edu

194^th place

182^nd place

21princeton.edu

802^nd place

528^th place

11cwi.nl

low place

11web.archive.org

1^st place

11oreilly.com

6,944^th place

5,088^th place

11sciencedirect.com

137^th place

146^th place

11doi.org

2^nd place

11worldcat.org

4^th place

11rfc-editor.org

747^th place

325^th place

11wenku.baidu.com

low place

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

homepages.cwi.nl

Schrijver (2005) Schrijver, Alexander (2005). "On the history of combinatorial optimization (till 1960)" (PDF). Handbook of Discrete Optimization. Elsevier: 1–68.

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

Dinitz, Yefim; Itzhak, Rotem (2017-01-01). "Hybrid Bellman–Ford–Dijkstra algorithm". Journal of Discrete Algorithms. 42: 35–44. doi:10.1016/j.jda.2017.01.001. ISSN 1570-8667.

oreilly.com (Global: 6,944^th place; English: 5,088^th place)

safari.oreilly.com

Sedgewick (2002). Sedgewick, Robert (2002). "Section 21.7: Negative Edge Weights". Algorithms in Java (3rd ed.). Addison-Wesley. ISBN 0-201-36121-3. Archived from the original on 2008-05-31. Retrieved 2007-05-28.

princeton.edu (Global: 802^nd place; English: 528^th place)

algs4.cs.princeton.edu

See Sedgewick's web exercises for Algorithms, 4th ed., exercises 5 and 12 (retrieved 2013-01-30).

rfc-editor.org (Global: 747^th place; English: 325^th place)

Malkin, Gary S. (November 1998). RIP Version 2 (Report). Internet Engineering Task Force.

rhul.ac.uk (Global: low place; English: low place)

cs.rhul.ac.uk

Bang-Jensen & Gutin (2000) Bang-Jensen, Jørgen; Gutin, Gregory (2000). "Section 2.3.4: The Bellman-Ford-Moore algorithm". Digraphs: Theory, Algorithms and Applications (First ed.). Springer. ISBN 978-1-84800-997-4.

sciencedirect.com (Global: 137^th place; English: 146^th place)

Dinitz, Yefim; Itzhak, Rotem (2017-01-01). "Hybrid Bellman–Ford–Dijkstra algorithm". Journal of Discrete Algorithms. 42: 35–44. doi:10.1016/j.jda.2017.01.001. ISSN 1570-8667.

stanford.edu (Global: 194^th place; English: 182^nd place)

web.stanford.edu

Lecture 14 stanford.edu

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

Sedgewick (2002). Sedgewick, Robert (2002). "Section 21.7: Negative Edge Weights". Algorithms in Java (3rd ed.). Addison-Wesley. ISBN 0-201-36121-3. Archived from the original on 2008-05-31. Retrieved 2007-05-28.

wenku.baidu.com (Global: low place; English: low place)

Duan, Fanding (1994). "关于最短路径的SPFA快速算法 [About the SPFA algorithm]". Journal of Southwest Jiaotong University. 29 (2): 207–212.

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

search.worldcat.org

Dinitz, Yefim; Itzhak, Rotem (2017-01-01). "Hybrid Bellman–Ford–Dijkstra algorithm". Journal of Discrete Algorithms. 42: 35–44. doi:10.1016/j.jda.2017.01.001. ISSN 1570-8667.

Bellman–Ford algorithm (English Wikipedia)

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

homepages.cwi.nl

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

oreilly.com (Global: 6,944th place; English: 5,088th place)

safari.oreilly.com

princeton.edu (Global: 802nd place; English: 528th place)

algs4.cs.princeton.edu

rfc-editor.org (Global: 747th place; English: 325th place)

rhul.ac.uk (Global: low place; English: low place)

cs.rhul.ac.uk

sciencedirect.com (Global: 137th place; English: 146th place)

stanford.edu (Global: 194th place; English: 182nd place)

web.stanford.edu

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

wenku.baidu.com (Global: low place; English: low place)

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

search.worldcat.org

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

oreilly.com (Global: 6,944^th place; English: 5,088^th place)

princeton.edu (Global: 802^nd place; English: 528^th place)

rfc-editor.org (Global: 747^th place; English: 325^th place)

sciencedirect.com (Global: 137^th place; English: 146^th place)

stanford.edu (Global: 194^th place; English: 182^nd place)

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

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