The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Graph stream algorithms: a survey
Abstract
Over the last decade, there has been considerable interest in designing algorithms for processing massive graphs in the data stream model. The original motivation was two-fold: a) in many applications, the dynamic graphs that arise are too large to be stored in the main memory of a single machine and b) considering graph problems yields new insights into the complexity of stream computation. However, the techniques developed in this area are now finding applications in other areas including data structures for dynamic graphs, approximation algorithms, and distributed and parallel computation. We survey the state-of-the-art results; identify general techniques; and highlight some simple algorithms that illustrate basic ideas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019604 · Cited by 1,433
Graph Sparsification by Effective Resistances
Spielman, D. A., & Srivastava, N. (2011) · SIAM Journal on Computing · doi:10.1137/080734029 · Cited by 489
Henzinger, M., Raghavan, P., & Rajagopalan, S. (1999) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/050/05 · Cited by 418
Spectral Sparsification of Graphs
Spielman, D. A., & Teng, S.-H. (2011) · SIAM Journal on Computing · doi:10.1137/08074489x · Cited by 409
On graph problems in a semi-streaming model
Joan Feigenbaum, A., Kannan, S., McGregor, A., Suri, S., & Zhang, J. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.013 · Cited by 402
Self-citationACM-SIAM Symposium on Discrete Algorithms
Clifford, R., Jalsenius, M., & Sach, B. (2015) · Symposium on Discrete Algorithms · Cited by 273
Counting triangles in data streams
Buriol, L. S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., & Sohler, C. (2006) · Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1142351.1142388 · Cited by 252
Graph sketches: sparsification, spanners, and subgraphs
Ahn, K. J., Guha, S., & McGregor, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213560 · Cited by 223
Self-citationDensest subgraph in streaming and MapReduce
Bahmani, B., Kumar, R., & Vassilvitskii, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2140436.2140442 · Cited by 219
Cited by
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabrys, B., & Musial, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 331
Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs
Manzoor, E., Milajerdi, S. M., & Akoglu, L. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939783 · Cited by 291
Competitive Caching with Machine Learned Advice
Lykouris, T., & Vassilvitskii, S. (2021) · Journal of the ACM · doi:10.1145/3447579 · Cited by 172
Summarizing static and dynamic big graphs
Khan, A., Bhowmick, S. S., & Bonchi, F. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137765.3137825 · Cited by 45
Metadata
- Authors
- McGregor, A.
- Venue
- ACM SIGMOD Record
- Published
- 2014-05-13
- Volume
- 43
- Issue
- 1
- Pages
- 9-20
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2016289973
- Cited by
- 357
- References
- 24
- FWCI
- 28.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph stream algorithms: a survey. https://app.cochat.ai/papers/10.1145/2627692.2627694
- The paper
- McGregor, A. (2014). Graph stream algorithms: a survey. ACM SIGMOD Record. https://doi.org/10.1145/2627692.2627694
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.