Algorithm to compute partitions of a graph in N cliques
-
05-11-2019 - |
Pregunta
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.
No hay solución correcta
Licenciado bajo: CC-BY-SA con atribución
No afiliado a cs.stackexchange