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

[Sinan KALKAN]

hello there,

i am a newbie to the igraph library. i am planning to use it for
finding maximum common sub-graphs of two graphs using
the maximum clique functionalities provided in igraph. i am
also interested in GraphML/GML read/write functionalities.

i'd like to ask which algorithm/approach does the maximum clique
finding functions make use of. i've searched through the documentation,
the emailing list archives and the source code but it seems that
the algorithm is not described/named anywhere.

thank you for the good work for developing such a useful library
and for any hints for my question, in advance.

best regards

-- 
Sinan KALKAN
Bernstein Center for Compt. Neuroscience
Bunsenstr. 10
37073 Goettingen / Germany