Evolutionary network analysis has found an increasing interest in the literature because of
the importance of different kinds of dynamic social networks, email networks, biological …

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 …

When processing massive data sets, a core task is to construct synopses of the data. To be
useful, a synopsis data structure should be easy to construct while also yielding good …

We initiate the study of graph sketching, ie, algorithms that use a limited number of linear
measurements of a graph to determine the properties of the graph. While a graph on n …

The problem of finding locally dense components of a graph is an important primitive in data
analysis, with wide-ranging applications from community mining to spam detection and the …

Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …

We present O (loglog n)-round algorithms in the Massively Parallel Computation (MPC)
model, with Õ (n) memory per machine, that compute a maximal independent set, a 1+ ε …

There is a rapidly growing need for scalable algorithms that solve classical graph problems,
such as maximum matching and minimum vertex cover, on massive graphs. For massive …

We present dynamic algorithms with polylogarithmic update time for estimating the size of
the maximum matching of a graph undergoing edge insertions and deletions with …

We present a deterministic (1+ ε)-approximate maximum matching algorithm in poly (1/ε)
passes in the semi-streaming model, solving the long-standing open problem of breaking …