Streaming Graph Algorithms
Streaming Graph Algorithms is a class of graph algorithms designed to process massive graphs in a streaming model, where edges or vertices arrive sequentially over time and the algorithm must make decisions with limited memory and a small number of passes over the data.
235
Publications
13.3K
Citations
497
Authors
197
Institutions
Publications per year
2017–2026
93
235
Albert D. Alexandrov, Mihai Ionescu, Klaus E. Schauser et al. · 1995 · 490 citations
Streaming graph partitioning for large distributed graphs
Isabelle Stanton, Gabriel Kliot · 2012 · 441 citations
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor et al. · Theoretical Computer Science · 2005 · 422 citations
Graph Twiddling in a MapReduce World
Jeffrey P. Cohen · Computing in Science & Engineering · 2009 · 416 citations
Andrew McGregor · ACM SIGMOD Record · 2014 · 365 citations
1–5 of 235
497
13
h-index
10
h-index
9
h-index
9
h-index
9
h-index
1–5 of 497
197

University of Massachusetts Amherst
Amherst Center, United States
11 h-index
15 publications
615 citations
University of Pennsylvania
Philadelphia, United States
10 h-index
21 publications
2.4K citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
22 publications
1.9K citations

Sapienza University of Rome
Rome, Italy
10 h-index
28 publications
1.9K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
9 h-index
10 publications
201 citations

University of Warwick
Coventry, United Kingdom
8 h-index
9 publications
225 citations
Microsoft (United States)
Redmond, United States
8 h-index
12 publications
1.9K citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
14 publications
683 citations
1–8 of 197
PVLDB · 15 publications · 1.5K citations
15
h-index
Repository · 17 publications · 382 citations
12
h-index
TKDD · 9 publications · 642 citations
9
h-index
Repository · 9 publications · 217 citations
9
h-index
7 publications · 210 citations
7
h-index
1–5