does anyone know of an efficient algorithm to compute the partition of a graph in N cliques?

Notice that N is the number of the cliques and not the size of them.

I have heard of the 2 cliques problem, but I'm interested in the more general version.


1 Answer 1


This problem is known as clique cover and it's NP-complete. In other words, no efficient algorithm is known.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.