[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

RE: [igraph] edge betweenness

From: Sergio Jiménez
Subject: RE: [igraph] edge betweenness
Date: Mon, 17 Nov 2008 17:15:54 +0100

Beyond  Kurt’s answer, I would ask to igraph experts a summary table of computation complexity and approximate cpu times for a pair of graph sizes for the different community detection algorithms implemented in Igraph.






De: address@hidden [mailto:address@hidden En nombre de Kurt J
Enviado el: lunes, 17 de noviembre de 2008 16:23
Para: Help for igraph users
Asunto: [igraph] edge betweenness


Hi igraphers,

I've been working w/ community detection and I want to apply the edge betweenness method.  However, with a graph ~20k nodes the community_edge_betweenness method seems to just hang.  It's been running for 5 days or so...  I understand this is rather expensive - like O(kmn) - but i thought it would get'er done eventually

in the python interface is there a way to terminate the algorithm before completion?

is there a verbose mode where i can see more of what is going on?

Kurt J

No virus found in this incoming message.
Checked by AVG - http://www.avg.com
Version: 8.0.175 / Virus Database: 270.9.0/1779 - Release Date: 16/11/2008 19:58

reply via email to

[Prev in Thread] Current Thread [Next in Thread]