Edge betweenness

From Cohen Courses
Revision as of 04:01, 27 September 2012 by Dzheng (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

It is a method discussed in the paper Girvan et al PNAS 2002.

The paper defines the edge betweenness of an edge as the number of shortest paths between pairs of vertices that run along it. If there is more than one shortest path between a pair of vertices, each path is given equal weight such that the total weight of all the paths is unity.

External reference