4 ms·

It looks like this algorithm is solving for whether the graph contains at least one triangle rather than counting or listing all triangles.

• vegafrank 2y ago
  [dead]
• deleted 2y ago
  [deleted]
• adrianN 2y ago
  „… which it follows that triangle detection can be solved in time O(m^{1.407})“