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
Parents
119
Andrew McGregor · ACM SIGMOD Record · 2014 · 365 citations
Logarithmic Lower Bounds in the Cell-Probe Model
Mihai Pǎtraşcu, Erik D. Demaine · SIAM Journal on Computing · 2006 · 213 citations
1–5 of 119
284
10
h-index
8
h-index
6
h-index
4
h-index
4
h-index
1–5 of 284
136
Georgia Institute of Technology
Atlanta, United States
12 h-index
23 publications
982 citations
University of California, Irvine
Irvine, United States
6 h-index
10 publications
396 citations

University of Waterloo
Waterloo, Canada
6 h-index
8 publications
304 citations
Stanford University
Stanford, United States
5 h-index
8 publications
497 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
219 citations
Princeton University
Princeton, United States
5 h-index
8 publications
300 citations
University of Vienna
Vienna, Austria
4 h-index
7 publications
199 citations

Cornell University
Ithaca, United States
3 h-index
3 publications
164 citations
1–8 of 136
8 publications · 490 citations
8
h-index
Conference · 6 publications · 311 citations
6
h-index
Repository · 6 publications · 144 citations
6
h-index
PVLDB · 6 publications · 208 citations
6
h-index
JGAA · 4 publications · 110 citations
4
h-index
1–5