4 Sep
2008
4 Sep
'08
11:09 a.m.
Hi Rui, On 09/04/2008 12:57 PM, Rui Carvalho wrote:
Until you implement it, my understanding is that to get absolute betweenness values we need to multiply node/edge betweenness by the following factors: Node betweenness: (N-1)*(N-2)/2 Edge betweenness: N*(N-1)/2
Is this correct?
Yes, this is correct for undirected graphs. For directed graphs it becomes (n-2)*(n-1) and n*(n-1), for vertex and edge betweenness respectively.
P.S.: good luck with the post-doc work ;)
Thanks. ;-) Cheers, Tiago -- Tiago de Paula Peixoto <tiago@forked.de>