Floyd-warshall Algorithm

Floyd-Warshall Algorithm is a dynamic programming algorithm for solving the all-pairs shortest path problem in weighted directed graphs by systematically updating shortest path estimates between every pair of vertices through intermediate nodes.

90

Publications

2.6K

Citations

262

Authors

114

Institutions

Publications per year

2017–2026

32

Variants

Floyd-warshallFloyd-warshall-roy AlgorithmRoy-floyd Algorithm

Authors

262

  1. MP
    M. Penner

    University of Southern California, United States

    4 publications · 157 citations

    4

    h-index

  2. VK
    Viktor K. Prasanna

    University of Southern California, United States

    4 publications · 157 citations

    4

    h-index

  3. RC
    Rezaul Chowdhury

    The University of Texas at Austin, United States

    3 publications · 115 citations

    3

    h-index

  4. UB
    Uday Bondhugula

    Indian Institute of Science Bangalore, India

    2 publications · 56 citations

    2

    h-index

  5. MK
    Mufida Khairani

    Pelita Harapan University, Indonesia

    2 publications · 22 citations

    2

    h-index

1–5 of 262

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 132 citations

    3

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 44 citations

    3

    h-index

  3. Networks

    2 publications · 195 citations

    2

    h-index

  4. Journal of Physics Conference Series

    2 publications · 22 citations

    2

    h-index

  5. Society for Industrial and Applied Mathematics eBooks

    Ebook platform · 1 publications · 10 citations

    1

    h-index

1–5