Improved Massively Parallel Triangle Counting in $O(1)$ Rounds

Quanquan C. Liu, C. Seshadhri

In this short note, we give a novel algorithm for $O(1)$ round triangle counting in bounded arboricity graphs. Counting triangles in $O(1)$ rounds (exactly) is listed as one of the…