Dynamic Graph Algorithms

Dynamic Graph Algorithms is a class of graph algorithms designed to efficiently maintain and update graph properties under a sequence of dynamically changing graph structures, distinguishing itself from static graph algorithms by supporting edge and vertex insertions or deletions without reprocessing the entire graph from scratch.

406

Publications

18.3K

Citations

782

Authors

307

Institutions

Publications per year

2017–2026

138

Authors

782

  1. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    24 publications · 1.5K citations

    20

    h-index

  2. MH
    Monika Henzinger

    University of Vienna, Austria

    19 publications · 1.2K citations

    15

    h-index

  3. LR
    Liam Roditty

    Bar-Ilan University, Israel

    13 publications · 565 citations

    12

    h-index

  4. DF
    Daniele Frigioni

    University of L'Aquila, Italy

    10 publications · 454 citations

    10

    h-index

  5. XL
    Xuemin Lin

    UNSW Sydney, Australia

    9 publications · 424 citations

    9

    h-index

1–5 of 782

Venues

  1. SIAM Journal on Computing

    18 publications · 1.1K citations

    16

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 16 publications · 887 citations

    15

    h-index

  3. arXiv (Cornell University)

    Repository · 16 publications · 481 citations

    13

    h-index

  4. Journal of the ACM

    JACM · 9 publications · 1.5K citations

    9

    h-index

  5. ACM Journal of Experimental Algorithmics

    JEA · 9 publications · 352 citations

    9

    h-index

1–5