Re: [igraph] edge_betweenness community detection

[Gábor Csárdi]

On Fri, Jan 15, 2010 at 3:55 PM, Gábor Csárdi <address@hidden> wrote:
> Hi,
>
> how should we know that? It depends on your computer and on your graph.
>
> But you can try to estimate it yourself.  Try running a simple edge
> betweenness calculation and measure the running time (T). The running
> time for the community detection will be 1/2 n * T, where n is the
> number of vertices in the graph. This is just a rough estimate.

Ooops, Tamas is right of course, n is the number of edges in this formula....

G.

> To get a better estimate, run the community detection on smaller
> graphs with similar density and degree distribution, for graph with
> (say) 50, 100, 200, 500, 1000 vertices and extrapolate from that.
>
> Best,
> Gabor
>
> On Fri, Jan 15, 2010 at 3:49 PM, zhengjun chen <address@hidden> wrote:
>> Hi,
>> I run igraph_community_edge_betweenness () on my dataset. The dataset
>> consists of 12,000 nodes and 222,156 edges.
>> The program has been running the whole night. It still does not finish.
>> In contrast, fastgreedy community detection can finish in much less time.
>> So, could anyone can tell me a rough time that the edge_betweenness() needs
>> to detect community?
>> --
>> Thanks
>> zhengjun
>>
>>
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>>
>>
>
>
>
> --
> Gabor Csardi <address@hidden>     UNIL DGM
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM