|
From: | Ahmed Abdeen Hamed |
Subject: | Re: [igraph] Reverse engineering affiliation networks |
Date: | Tue, 16 Jun 2015 14:54:44 -0400 |
> 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.
[Prev in Thread] | Current Thread | [Next in Thread] |