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
Parents
126
1–5 of 126
360
University of California, Santa Cruz, United States
4 publications · 486 citations
4
h-index
3
h-index
Commonwealth Scientific and Industrial Research Organisation, Australia
3 publications · 73 citations
3
h-index
3
h-index
University of Maryland, College Park, United States
3 publications · 61 citations
3
h-index
1–5 of 360
170
University of Maryland, College Park
College Park, United States
6 h-index
17 publications
9.9K citations
University of Technology Sydney
Sydney, Australia
3 h-index
7 publications
181 citations

South China University of Technology
Guangzhou, China
3 h-index
10 publications
462 citations
IBM (United States)
Armonk, United States
3 h-index
6 publications
6.8K citations

Tohoku University
Sendai, Japan
3 h-index
7 publications
170 citations

Iwate Prefectural University
Takizawa, Japan
3 h-index
5 publications
208 citations

Commonwealth Scientific and Industrial Research Organisation
Canberra, Australia
3 h-index
3 publications
73 citations
Tsinghua University
Beijing, China
3 h-index
5 publications
225 citations
1–8 of 170
4 publications · 145 citations
4
h-index
CCR · 3 publications · 6.8K citations
3
h-index
3 publications · 101 citations
3
h-index
2 publications · 196 citations
2
h-index
2 publications · 91 citations
2
h-index
1–5