Given a graph stream, how can we estimate the number of triangles in it using multiple machines with limited storage? Specifically, should edges be processed and sampled across for rapid accurate estimation? The count (i.e., cliques size three) has proven useful numerous applications, including anomaly detection, community link recommendation. For triangle counting large dynamic graphs, recent ...