Incremental Shortest Path Algorithms

Incremental Shortest Path Algorithms is a class of dynamic shortest path algorithms that, belonging to the broader category of shortest path algorithms, are distinguished by their ability to efficiently update shortest path information in response to incremental changes in the graph structure, such as edge weight modifications or vertex/edge insertions, without re-computing the entire solution from scratch.

50

Publications

2K

Citations

129

Authors

68

Institutions

Publications per year

2017–2026

14

Authors

129

  1. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    4 publications · 227 citations

    4

    h-index

  2. SC
    Shiri Chechik

    Tel Aviv University, Israel

    4 publications · 140 citations

    4

    h-index

  3. XS
    Xiaoxun Sun

    University of Southern Queensland, Australia

    3 publications · 72 citations

    3

    h-index

  4. SK
    Sven Koenig

    University of Southern California, United States

    3 publications · 72 citations

    3

    h-index

  5. WY
    William Yeoh

    New Mexico State University, United States

    3 publications · 72 citations

    3

    h-index

1–5 of 129

Venues

  1. Symposium on Discrete Algorithms

    Conference · 3 publications · 87 citations

    3

    h-index

  2. 2

    h-index

  3. 2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 34 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 2 publications · 35 citations

    2

    h-index

1–5