Re: [igraph] Removing nodes that are not in a clique

[Tamas Nepusz]

Hi Thomas,

Finding all 3-cliques is slow in general because usually there are a
lot of them. Try finding the maximal cliques instead, then filter that
list to the maximal cliques of size 2, add the set of isolated nodes
and then you have the set of nodes to remove.

T.

T.


On Wed, Sep 2, 2015 at 2:06 PM, Thomas Chesney
<address@hidden> wrote:
> Can anyone please show me how to remove all nodes from a graph that do not 
> appear in:
>
> cliques(g, min=3, max=3)
>
> There are 69,000 nodes in the graph. Is there a way to estimate how long 
> 'cliques(g, min=3, max=3)' will take to run?
>
> Thank you,
>
> Thomas Chesney
>
>
>
> This message and any attachment are intended solely for the addressee
> and may contain confidential information. If you have received this
> message in error, please send it back to me, and immediately delete it.
>
> Please do not use, copy or disclose the information contained in this
> message or in any attachment.  Any views or opinions expressed by the
> author of this email do not necessarily reflect the views of the
> University of Nottingham.
>
> This message has been checked for viruses but the contents of an
> attachment may still contain software viruses which could damage your
> computer system, you are advised to perform your own checks. Email
> communications with the University of Nottingham may be monitored as
> permitted by UK legislation.
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help