In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

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 …

Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs
are natural fundamental problems, which have recently received much attention because of …

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 …

Counting the number of triangles in a graph is a beautiful algorithmic problem which has
gained importance over the last years due to its significant role in complex network analysis …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

This paper presents a new space-efficient algorithm for counting and sampling triangles--
and more generally, constant-sized cliques--in a massive graph whose edges arrive as a …

“Ogni lassada xe persa.” 1--Proverb from Trieste, Italy. We present trièst, a suite of one-pass
streaming algorithms to compute unbiased, low-variance, high-quality approximations of the …

We present two space bounded random sampling algorithms that compute an
approximation of the number of triangles in an undirected graph given as a stream of edges …

We consider the problem of estimating the number of triangles in a graph. This problem has
been extensively studied in both theory and practice, but all existing algorithms read the …