Finding Maximal Clique in O(n^2) Time?

173 Views Asked by At

I was making a research about Clique Problem and algorithms. Then I saw that. As this article says, we can find maximal clique in O(n^2) time complexity. Did I misunderstand something or this is a proof that P=NP?

0

There are 0 best solutions below