Counting Triangles

Can someone tell me how to count triangles in a graph in nsqrtn

In nsqrtn ?
i don’t think it is possible to do it nsqrtn , the fastest i know is using Strassen’s matrix multiplication which does it in O(n^2.8)
and guess what that too is inefficient in practical purposes because it takes large amount of extra memory in recursion.
So conventional O(n^3) is best i know so far
PS :If you are able to find an algo which works in nsqrtn please do tell me :slightly_smiling_face:

Link to the problem?

Yeah without it we should wait for at least 10 days before replying ( because a ongoing contest may last for 10 days or someone else might report meanwhile)

1 Like

How about in undirected graph