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

Authors

82

  1. TC
    Tzung-Nan Chuang

    Republic of China Naval Academy, Taiwan

    3 publications · 53 citations

    3

    h-index

  2. TH
    Tzung‐Pei Hong

    National University of Kaohsiung, Taiwan

    3 publications · 53 citations

    3

    h-index

  3. ID
    I. D. Hill

    Medical Research Council, United Kingdom

    2 publications · 474 citations

    2

    h-index

  4. MJ
    M. J. Jamieson

    Center for Astrophysics Harvard & Smithsonian, United States

    2 publications · 48 citations

    2

    h-index

  5. LP
    Léon Planken

    Delft University of Technology, Netherlands

    2 publications · 57 citations

    2

    h-index

1–5 of 82

Venues

  1. 2

    h-index

  2. Information Processing Letters

    2 publications · 24 citations

    2

    h-index

  3. Symposium on Discrete Algorithms

    Conference · 2 publications · 295 citations

    2

    h-index

  4. Communications of the ACM

    1 publications · 21 citations

    1

    h-index

  5. Journal of Artificial Intelligence Research

    JAIR · 1 publications · 46 citations

    1

    h-index

1–5