What is the name of a technique for finding $K_n$'s in a graph

45 Views Asked by At

It has something to do with heating the graph and cooling it down. I had searched a bit about it but now that I have time to go deeper into it it just disappeared from my history. I remember seeing a python code for it with heating and cooling the graph in very specific temperatures

1

There are 1 best solutions below

2
On BEST ANSWER

In general, the problem of finding $K_n$'s in a graph is the clique problem.

The technique you're describing though (which you self-answered), is something called simulated annealing.