Shortest Path Length

Shortest Path Length is a graph-theoretic metric that quantifies the minimum number of edges or the least cumulative weight along any path connecting two distinct nodes in a network.

474

Publications

23.8K

Citations

1.4K

Authors

595

Institutions

Publications per year

2017–2026

140

Authors

1.4K

  1. SB
    Said Broumi

    University of Hassan II Casablanca, Morocco

    5 publications · 197 citations

    5

    h-index

  2. MK
    Michihiro Koibuchi

    National Institute of Informatics, Japan

    5 publications · 212 citations

    5

    h-index

  3. JS
    Joseph S. B. Mitchell

    Stony Brook University, United States

    5 publications · 384 citations

    5

    h-index

  4. KL
    Klaus Lehnertz

    University of Bonn, Germany

    5 publications · 158 citations

    5

    h-index

  5. DH
    Dan Halperin

    Tel Aviv University, Israel

    4 publications · 128 citations

    4

    h-index

1–5 of 1.4K

Venues

  1. Physical Review E

    PRE · 13 publications · 472 citations

    12

    h-index

  2. Scientific Reports

    8 publications · 268 citations

    8

    h-index

  3. IEEE Access

    8 publications · 378 citations

    8

    h-index

  4. PLoS ONE

    6 publications · 1.6K citations

    6

    h-index

  5. International Journal of Modern Physics C

    6 publications · 145 citations

    6

    h-index

1–5