Graph stream algorithms: a survey

456 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs (2016, background): “Work on sketching graphs has primarily focused on constructing sketches that enable approximate solutions to specific graph problems such as finding the min-cut, testing reachability and finding the densest subgraph [25]; the proposed sketches cannot be applied directly to detect graph-based anomali”
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey (2020, background): “For a more in-depth discussion of the graph streams, we refer the interested reader to [3], [32], [34].”