CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

A faster algorithm for betweenness centrality

by: U. Brandes
(2001)

X 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.

View the full article here:

CiteSeerX Beta

This article has been bookmarked 20 times, initially on 2005-08-18.

2009-12-15 User senseable-urb
2009-08-16 User ganden
2009-08-07 User tnhh
2009-08-03 User sergiun
2009-07-24 User semantic01
2009-07-07 User cscw01
2007-10-10 User grahamc
2007-10-04 User jmarcelino
2007-10-01 User jaspervoskuilen
2007-09-15 User andreacapocci
2007-08-10 User nojhan
Group EvolutionaryComputation
Group Metaheuristics
Group Optimization
User salvoscellato , 1 note

Best algorithm for betweenness centrality on complex networks.

2007-08-10 17:56:31
2007-05-31 User tokushiman
2007-05-03 User gcalda
2006-06-29 User maqbes , 1 note

Betweenness Centralityは社会ネットワーク解析で大事だけど，計算コストがかかる． 現行のアルゴリズムでは，最速でも時間にしてO(n^3)，空間でも(n^2)かかる． 今回の論文で紹介されているアルゴリズムを使えば空間計算量がO(n+m)で，時間計算量にしてO(nm+n^2logn)で計算できる．

2006-06-29 08:03:34
2005-11-17 User schaal
2005-08-18 User shivaram
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.