Hi,
I need to find the clique number of a non-oriented graph. As far as I know this is an np-complete poblem so the complexity of a standart algorithm will be around O(n^3) and with the graph being with 10 000 nodes max I think a full solve is impossible.

So I'm looking for a heuristical (is this correct to say :rolleyes: ) solve. I only managed to find the Reactive Local Search algorithm but it's only source. It is good as the complexity is linear to the edges but they dont offer any explanations and unofrtunately I have to understand it to use it.

Does anyone has any good ideas on the matter? I'd settle for O(n^2) complexity. Pseudo code will also do...

Thanks in advance for any help!