On variants of shortest-path betweenness centrality and their generic computation
Author:
- Ulrik BrandesUBUlrik Brandes
Top Cited Papers
Open Access
- 1 May 2008
- journal article
- Published by Elsevier in Social Networks
- Vol. 30 (2) , 136-145
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Fast algorithm for successive computation of group betweenness centralityPhysical Review E, 2007
- Erratum: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality [Phys. Rev. E64, 016132 (2001)]Physical Review E, 2006
- Centrality and network flowSocial Networks, 2005
- Analysis of weighted networksPhysical Review E, 2004
- Sexual network analysis of a gonorrhoea outbreakSexually Transmitted Infections, 2004
- Universal Behavior of Load Distribution in Scale-Free NetworksPhysical Review Letters, 2001
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- Betweenness centrality measures for directed graphsSocial Networks, 1994
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977