A Faster Algorithm for Betweenness Centrality (2001)
Cached
Download Links
- [www.inf.uni-konstanz.de]
- [www.cs.sunysb.edu]
- [www.informatik.uni-konstanz.de]
- [www.cs.ucc.ie]
- CiteULike
Other Repositories/Bibliography
by
Ulrik Brandes
| Venue: | Journal of Mathematical Sociology |
| Citations: | 169 - 5 self |
BibTeX
@ARTICLE{Brandes01afaster,
author = {Ulrik Brandes},
title = {A Faster Algorithm for Betweenness Centrality},
journal = {Journal of Mathematical Sociology},
year = {2001},
volume = {25},
pages = {163--177}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
