Re: [igraph] Best function to return the size of the maximum clique expediently

[Szabolcs Horvát]

The good news is that the development version of igraph C core already incorporates the Cliquer library you mentioned, and therefore it became much faster at clique finding.

The currently released R and Python interfaces do not include this change yet, but I assume it will be in their next release.

The present release of the Mathematica interface does include it as the IGCliqueNumber function (http://szhorvat.net/mathematica/IGraphM)

You can also you the development version of the C interface from GitHub, but that would give little advantage over just using Cliquer directly.

On 12 April 2017 at 16:43, Therese Donovan <address@hidden> wrote:

Hello. First of all, thank you for producing igraph.   I am new to igraph and have been working with a colleague who uses the program, cliquer, to find the maximum clique size of a given graph.  Given a set of edges in a graph, I have been trying to use the clique_num() function in igraph to return the size of the maximum clique.  This is the only output needed – the number of points -- we do not need to store all possible cliques.  Cliquer can do this very quickly using a branch and bound algorithm developed by Patric Östergård.  Is there a more appropriate function than clique_num() that can return the number of points in a clique that is maximal?

 

Thank you for your consideration.

 

 

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help