Dynamic Graph Data Structures

Dynamic Graph Data Structures is a class of graph data structures that belongs to the broader category of dynamic data structures, specifically designed to efficiently support the incremental insertion, deletion, and modification of vertices and edges while maintaining representational integrity and enabling fast query responses over evolving graph topologies.

119

Publications

5.3K

Citations

284

Authors

136

Institutions

Publications per year

2017–2026

43

Authors

284

  1. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    10 publications · 349 citations

    10

    h-index

  2. DE
    David Eppstein

    University of California, Irvine, United States

    8 publications · 383 citations

    8

    h-index

  3. MH
    Monika Henzinger

    University of Vienna, Austria

    6 publications · 498 citations

    6

    h-index

  4. ZG
    Zvi Galil

    Tel Aviv University, Israel

    4 publications · 154 citations

    4

    h-index

  5. DA
    David A. Bader

    Georgia Institute of Technology, United States

    4 publications · 207 citations

    4

    h-index

1–5 of 284

Venues

  1. SIAM Journal on Computing

    8 publications · 490 citations

    8

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 6 publications · 311 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 6 publications · 144 citations

    6

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 6 publications · 208 citations

    6

    h-index

  5. Journal of Graph Algorithms and Applications

    JGAA · 4 publications · 110 citations

    4

    h-index

1–5