Engineering a Distributed-Memory Triangle Counting Algorithm

Peter Sanders, Tim Niklas Uhl

Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs…