Inproceedings,

A Faster Algorithm for Betweenness Centrality

.
Journal of Mathematical Sociology, 25, page 163--177. (2001)

Abstract

The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require \#(n ) time and \#(n ) space, where n is the number of actors in the network.

Tags

Users

  • @steff83
  • @jm
  • @nonancourt
  • @lantiq
  • @cameron
  • @schaal
  • @andreacapocci
  • @dbenz
  • @lee_peck
  • @tfalk
  • @cbrewster
  • @snarc

Comments and Reviews