Triangle counting algorithm

[byjtew]

Algorithms for triangle counting

• Burkhardt : sum_reduce( (A^2) .* A ) / 6
• Cohen : sum_reduce( (L * U) .* A ) / 2
• Sandia : sum_reduce( (T * T) .* T )
  • T being either the lower (L) or upper (U) triangle matrix of A

Routines implied

• Out-of-place matrix-matrix multiplication (required, implemented)
• Out-of-place masked matrix-matrix multiplication (optimal, not implemented)
• Out-of-place masked matrix power-2 kernel (optimal, not implemented)
• Haddamard product (required, implemented)
• L/U matrix split (required, not implemented)
• Matrix-to-scalar sum reduction (required, __see this issue .
• Check if a matrix is symmetric (optimal, not implemented)
• All-but-diagonal matrix mask (optimal, not implemented)