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
406
Querying k-truss community in large and dynamic graphs
Xin Huang, Hong Cheng, Lu Qin et al. · 2014 · 490 citations
Sparsification—a technique for speeding up dynamic graph algorithms
David Eppstein, Zvi Galil, Giuseppe F. Italiano et al. · Journal of the ACM · 1997 · 290 citations · Full text
1–5 of 406
782
20
h-index
15
h-index
12
h-index
10
h-index
9
h-index
1–5 of 782
307
Georgia Institute of Technology
Atlanta, United States
16 h-index
39 publications
1.2K citations
University of Vienna
Vienna, Austria
13 h-index
23 publications
848 citations

Tel Aviv University
Tel Aviv, Israel
13 h-index
18 publications
1.1K citations
Stanford University
Stanford, United States
13 h-index
24 publications
1.7K citations

Sapienza University of Rome
Rome, Italy
11 h-index
20 publications
1.6K citations
University of Copenhagen
Copenhagen, Denmark
10 h-index
16 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
13 publications
678 citations

UNSW Sydney
Sydney, Australia
10 h-index
15 publications
785 citations
1–8 of 307
18 publications · 1.1K citations
16
h-index
PVLDB · 16 publications · 887 citations
15
h-index
Repository · 16 publications · 481 citations
13
h-index
JACM · 9 publications · 1.5K citations
9
h-index
JEA · 9 publications · 352 citations
9
h-index
1–5