Re: [igraph] Reverse engineering affiliation networks

[Ahmed Abdeen Hamed]

Thanks very much for this!

-Ahmed

On Mon, Jun 15, 2015 at 7:45 AM, Tamas Nepusz <address@hidden> wrote:

> There are three overlapping cliques (source Coursera SNA): The green, the
> purple and red. What does it take in terms of time to search a graph with
> overlapping cliques starting from the largest to the smallest?
Use igraph_maximal_cliques() (or the maximal_cliques() method from Python).

For the time complexity, see:
http://igraph.org/c/doc/igraph-Cliques.html#igraph_maximal_cliques

T.