[Nauty] Cliques

[Gunnar Brinkmann]

> I have a very silly question.
> 
> How do I find cliques in graphs of arbitrary sizes using nauty ?

Not at all -- nauty is designed for isomorphism rejection and 
automorphism group computation.

Since the max clique problem is NP-complete, you won't find programs
that work on all graphs of "arbitrary sizes".  If your graphs are
really big and maybe dense, you will have a problem. You should maybe mail
to DMANET asking for programs with a more precise description of
the graphs you want to test.

					Best wishes,

						Gunnar