Re: [igraph] Qcut algorithm?

[Gang Su]

Hi Gabor,

The authors used a two-step algorithm which includes 1. recursive 
partition. 2. refinement.
The refinement part is independent of the community algorithm. And 
actually this scheme can be applied to any community algorithm which
can work on disconnected graphs (also we can have a fix to let it work 
on connected graphs).

It gives smaller communities for larger networks.
Actually it's not very difficult to implement this 2-step procedure in 
R, but it won't be very efficient.
So I was wondering actually instead of Q-cut, do you have a plan for 
implementation of such
multi-step procedures. I can be very helpful because it's generic, and 
can actually work on any graph partitioning algorithm.

Gang

On 5/19/2010 4:56 AM, Gábor Csárdi wrote:
> Hi Gang,
>
> there are no such plans as far as I know, but I've added it to the wishlist:
> https://bugs.launchpad.net/igraph/+bug/582712
>
> This does not mean much, however.....
>
> Best,
> Gabor
>
> On Tue, May 18, 2010 at 7:52 PM, Gang Su<address@hidden>  wrote:
>    
> > Dear developers,
> >
> > Just wonder whether igraph is planning to integrate the qcut algorithm?
> > Which is listed here:
> > http://www.ncbi.nlm.nih.gov/pubmed/18351912
> >
> > Gang
> >
> > _______________________________________________
> > igraph-help mailing list
> > address@hidden
> > http://lists.nongnu.org/mailman/listinfo/igraph-help
> >
> >      
>
>
>