Re: [igraph] the algorithm(s) used for maximum clique

[Tamas Nepusz]

Dear Sinan,

The maximal clique finding functions simply search for maximal
independent vertex sets in the complementer graph. The maximal
independent vertex sets are determined by the algorithm published in:

S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirawaka. A new algorithm
for generating all the maximal independent sets. SIAM J Computing,
6:505--517, 1977.

The original implementation was written by Kevin O'Neill and modified
by K M Briggs in the Very Nauty Graph Library
(http://keithbriggs.info/very_nauty.html). I simply re-wrote it to use
igraph's data structures.

-- 
Tamas