Re: [igraph] Reverse engineering affiliation networks

[Ahmed Abdeen Hamed]

Sure, here is an example: 

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?

Thanks very much,

-Ahmed

On Mon, Jun 8, 2015 at 3:56 PM, Tamas Nepusz <address@hidden> wrote:

> If I am interested in all events attended by all members such that
>
> In Case #2:  (A,B) --> E1 and (A,C) --> E2
I'm afraid I don't really understand what exactly you would like to calculate.
Can you post an example network and the associated calculation?

T.