Distributed Shortest Path Algorithms

Distributed Shortest Path Algorithms is a computational framework in graph theory that solves shortest path problems by coordinating multiple autonomous processing nodes, each with localized knowledge of the network, to collectively compute optimal routes without relying on a central authority.

135

Publications

6.8K

Citations

278

Authors

153

Institutions

Publications per year

2017–2026

32

Authors

278

  1. JL
    Jason Li

    Peter MacCallum Cancer Centre, Australia

    6 publications · 141 citations

    6

    h-index

  2. JG
    J.J. Garcia‐Luna‐Aceves

    University of California, Santa Cruz, United States

    6 publications · 292 citations

    6

    h-index

  3. CL
    Christoph Lenzen

    ETH Zurich, Switzerland

    5 publications · 155 citations

    5

    h-index

  4. DN
    Danupon Nanongkai

    University of Vienna, Austria

    5 publications · 284 citations

    5

    h-index

  5. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    4 publications · 86 citations

    4

    h-index

1–5 of 278

Venues

  1. IEEE Transactions on Computers

    5 publications · 370 citations

    5

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 65 citations

    4

    h-index

  3. SIAM Journal on Computing

    3 publications · 558 citations

    3

    h-index

  4. IEEE Transactions on Information Theory

    3 publications · 243 citations

    3

    h-index

  5. IEEE Transactions on Automatic Control

    3 publications · 261 citations

    3

    h-index

1–5