Betweenness Centrality

Sébastien Heymann edited this page Mar 1, 2015 · 1 revision

Node Betweenness Centrality measures how often a node appears on shortest paths between nodes in the network.

Description

http://en.wikipedia.org/wiki/Betweenness#Betweenness_centrality

Source code

See org.gephi.statistics.plugin.GraphDistance.java.

Acknowledgments

This code was implemented by Patrick McSweeney.

Implemented Algorithm

Ulrik Brandes (2001). A faster algorithm for betweenness centrality

Additional Reading

Clone this wiki locally
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.
Press h to open a hovercard with more details.