[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Reverse engineering affiliation networks
|
From: |
Tamas Nepusz |
|
Subject: |
Re: [igraph] Reverse engineering affiliation networks |
|
Date: |
Mon, 15 Jun 2015 13:45:42 +0200 |
|
User-agent: |
Mutt/1.5.23 (2014-03-12) |
> 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.