Algorithm to compute partitions of a graph in N cliques

cs.stackexchange https://cs.stackexchange.com/questions/111827

문제

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.

올바른 솔루션이 없습니다

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 cs.stackexchange
scroll top