Vertex and Hyperedge Connectivity in Dynamic Graph Streams

Sudipto Guha, Andrew McGregor, David Tench
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
more » ... graph sparsifiers. Vertex connectivity exhibits markedly different combinatorial structure than edge connectivity and appears to be harder to estimate in the dynamic graph stream model. Our hypergraph result generalizes the work of Ahn et al. (PODS 2012) on graph sparsification and has the added benefit of significantly simplifying the previous results. One of the main ideas is related to the problem of reconstructing subgraphs that satisfy a specific sparsity property. We introduce a more general notion of graph degeneracy and extend the graph reconstruction result of Becker et al. (IPDPS 2011).
doi:10.1145/2745754.2745763 dblp:conf/pods/GuhaMT15 fatcat:o2yg5pjzdrfghdnjbghvtlhey4