[igraph] RE: edge betweenness

[Kurt J]

> 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.

i have some figures here:

fastgreedy O(m log n)
walktrap O(n^2 log n)
edge betweenness O(kmn)

where n is #nodes m is #edges and k is the number of edges removed