Concepedia

Dynamic Shortest Paths

Dynamic Shortest Paths is a computational framework in graph theory that maintains shortest path information under dynamic modifications to the graph structure, such as edge insertions or deletions, distinguishing it from static shortest path algorithms by enabling efficient incremental updates without full recomputation.

170

Publications

8.4K

Citations

347

Authors

198

Institutions

Publications per year

2017–2026

40

Parents

Publications

170

COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

Bohan Xuan, A. Ferreira, Aubin Jarry · International Journal of Foundations of Computer Science · 2003 · 365 citations · Full text

, , +16

Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time

Ismaïl Chabini · Transportation Research Record Journal of the Transportation Research Board · 1998 · 332 citations

, , +15

Loop-free routing using diffusing computations

J.J. Garcia-Lunes-Aceves · IEEE/ACM Transactions on Networking · 1993 · 300 citations

, , +17

Expected shortest paths in dynamic and stochastic traffic networks

Liping Fu, Laurence R. Rilett · Transportation Research Part B Methodological · 1998 · 286 citations

, , +14

A new approach to dynamic all pairs shortest paths

Camil Demetrescu, Giuseppe F. Italiano · Journal of the ACM · 2004 · 270 citations

, , +16

1–5 of 170

Authors

347

  1. DF
    Daniele Frigioni

    University of L'Aquila, Italy

    9 publications · 206 citations

    9

    h-index

  2. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    7 publications · 617 citations

    7

    h-index

  3. LR
    Liam Roditty

    Bar-Ilan University, Israel

    6 publications · 364 citations

    6

    h-index

  4. CD
    Camil Demetrescu

    Sapienza University of Rome, Italy

    6 publications · 538 citations

    6

    h-index

  5. BJ
    B. John Oommen

    Carleton University, Canada

    5 publications · 189 citations

    5

    h-index

1–5 of 347

Institutions

198

  1. Massachusetts Institute of Technology

    Cambridge, United States

    13 h-index

    21 publications

    1.7K citations

  2. Tel Aviv University

    Tel Aviv, Israel

    8 h-index

    11 publications

    490 citations

  3. Sapienza University of Rome

    Rome, Italy

    8 h-index

    14 publications

    853 citations

  4. Hong Kong University of Science and Technology

    Hong Kong, Hong Kong

    7 h-index

    8 publications

    240 citations

  5. Carleton University

    Ottawa, Canada

    6 h-index

    10 publications

    442 citations

  6. University of L'Aquila

    L’Aquila, Italy

    6 h-index

    20 publications

    386 citations

  7. Microsoft (United States)

    Redmond, United States

    5 h-index

    6 publications

    145 citations

  8. University of Rome Tor Vergata

    Rome, Italy

    5 h-index

    6 publications

    595 citations

1–8 of 198

Venues

  1. Theoretical Computer Science

    7 publications · 209 citations

    7

    h-index

  2. Networks

    5 publications · 291 citations

    5

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 4 publications · 656 citations

    4

    h-index

  4. IEEE Access

    4 publications · 62 citations

    4

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 3 publications · 55 citations

    3

    h-index

1–5