Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams


We revisit the much-studied problem of space-efficiently estimating the number of triangles in a graph stream, and extensions of this problem to counting fixed-sized cliques and cycles. For the important special case of counting triangles, we give a 4-pass, (1± ε)-approximate, randomized algorithm using Õ(ε−2 m3/2/T ) space, where m is the number of edges… (More)
DOI: 10.4230/LIPIcs.STACS.2017.11


2 Figures and Tables

Slides referencing similar topics