Johnson's Algorithm
Johnson's Algorithm is a shortest path algorithm that combines Dijkstra's algorithm and the Bellman-Ford algorithm with reweighting techniques to efficiently compute all-pairs shortest paths in a sparse graph with negative edge weights.
41
Publications
2.3K
Citations
82
Authors
40
Institutions
Publications per year
2017–2026
6
Parents
41
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Howard Karloff · 1998 · 124 citations
1–5 of 41
82
3
h-index
3
h-index
2
h-index
Center for Astrophysics Harvard & Smithsonian, United States
2 publications · 48 citations
2
h-index
2
h-index
1–5 of 82
40

Delft University of Technology
Delft, The Netherlands
2 h-index
5 publications
160 citations

University College Cork
Cork, Ireland
2 h-index
4 publications
149 citations

Universidad de Sevilla
Seville, Spain
1 h-index
3 publications
147 citations
Shandong Institute of Automation
Jinan, China
1 h-index
2 publications
124 citations

University of Notre Dame
Notre Dame, United States
1 h-index
1 publications
15 citations
Purdue University Northwest
Hammond, United States
1 h-index
1 publications
62 citations

Oak Ridge National Laboratory
Oak Ridge, United States
1 h-index
2 publications
40 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
2 publications
40 citations
1–8 of 40
2 publications · 474 citations
2
h-index
2 publications · 24 citations
2
h-index
Conference · 2 publications · 295 citations
2
h-index
1 publications · 21 citations
1
h-index
JAIR · 1 publications · 46 citations
1
h-index
1–5