We revisit the well-studied problem of triangle count estimation in graph streams. Given a graph represented as a stream of $m$ edges, …
We study the problem of coloring a given graph using a small number of colors in several well-established models of computation for big …
We revisit the much-studied problem of space-efficiently estimating the number of triangles in a graph stream, and extensions of this …