A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Vertex and Hyperedge Connectivity in Dynamic Graph Streams
2015
Proceedings of the 34th ACM Symposium on Principles of Database Systems - PODS '15
A growing body of work addresses the challenge of processing dynamic graph streams: a graph is defined by a sequence of edge insertions and deletions and the goal is to construct synopses and compute properties of the graph while using only limited memory. Linear sketches have proved to be a powerful technique in this model and can also be used to minimize communication in distributed graph processing. We present the first linear sketches for estimating vertex connectivity and constructing
doi:10.1145/2745754.2745763
dblp:conf/pods/GuhaMT15
fatcat:o2yg5pjzdrfghdnjbghvtlhey4