Bellman-ford Algorithm

The Bellman-Ford Algorithm is a shortest path algorithm that computes single-source shortest paths in weighted directed graphs, distinguished from other such algorithms by its ability to handle edges with negative weights and detect negative-weight cycles.

126

Publications

16.1K

Citations

360

Authors

170

Institutions

Publications per year

2017–2026

41

Variants

Bellman-fordBellman-ford-moore Algorithm

Authors

360

  1. JG
    J.J. Garcia‐Luna‐Aceves

    University of California, Santa Cruz, United States

    4 publications · 486 citations

    4

    h-index

  2. IM
    Ibrahim Matta

    Boston University, United States

    3 publications · 61 citations

    3

    h-index

  3. RP
    Ren Ping Liu

    Commonwealth Scientific and Industrial Research Organisation, Australia

    3 publications · 73 citations

    3

    h-index

  4. GC
    Goutam Chakraborty

    Iwate Prefectural University, Japan

    3 publications · 120 citations

    3

    h-index

  5. KD
    Klaudia Dussa-Zieger

    University of Maryland, College Park, United States

    3 publications · 61 citations

    3

    h-index

1–5 of 360

Venues

  1. IEEE Transactions on Wireless Communications

    4 publications · 145 citations

    4

    h-index

  2. ACM SIGCOMM Computer Communication Review

    CCR · 3 publications · 6.8K citations

    3

    h-index

  3. 3

    h-index

  4. IEEE Transactions on Communications

    2 publications · 196 citations

    2

    h-index

  5. Complex & Intelligent Systems

    2 publications · 91 citations

    2

    h-index

1–5