P493: Enumeration of all triangles in a graph.

P493: Enumeration of all triangles in a graph.

Input:

A graph $G$.

Output:

All triangles in $G$.

Complexity:

$O(m^{3/2})$ total time.

Comment:

Reference:

[Schank2005] (Bibtex)