Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying …
We revisit the well-studied problem of triangle count estimation in graph streams. Given a graph represented as a stream of $m$ edges, …
We revisit the much-studied problem of space-efficiently estimating the number of triangles in a graph stream, and extensions of this …