Re: [igraph] "Community detection", minimizing modularity (bipartite graphs)

[Gábor Csárdi]

Hi, I don't think that there is a function for this in igraph. Gabor

On Sat, Jul 12, 2014 at 10:31 AM, Elena Tea Russo
<address@hidden> wrote:
>
> Hello everybody.
>
> I'm working with igraph C library and I was searching for community
> detection routines. I've found Neumann's algorithm for optimizing modularity
> (such as igraph_community_fastgreedy or
> igraph_community_leading_eigenvector), both based on Neumann's work;
>
> however, in his article (MEJ Newman: Finding community structure in networks
> using the eigenvectors of matrices, Phys Rev E 74:036104 (2006).) he also
> proposed to use Modularity's Minimization (instead of its Maximization) to
> find some particular structure such as quasi-bipartite graphs in the
> original graph. Is there some function for this, or some way to convert
> igraph's modularity maximization algorithms in order to do that?
>
> Thank you :)
> Have a nice day!
>
> Elena
>
> _______________________________________
>
> Elena Tea RUSSO - address@hidden
>
>
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>