%0 Generic %1 Brandes2001 %A Brandes, U. %D 2001 %K social-networks %T A faster algorithm for betweenness centrality %U http://citeseer.ist.psu.edu/brandes01faster.html %X 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.

@misc{Brandes2001, 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.}, added-at = {2007-07-06T10:33:42.000+0200}, author = {Brandes, U.}, biburl = {https://www.bibsonomy.org/bibtex/268278196bf9f72de48e6a72cfd00c5b6/schaal}, citeulike-article-id = {297939}, interhash = {dff547c1a86412c8f3742aab68f7a243}, intrahash = {68278196bf9f72de48e6a72cfd00c5b6}, keywords = {social-networks}, priority = {2}, timestamp = {2007-07-06T10:33:49.000+0200}, title = {A faster algorithm for betweenness centrality}, url = {http://citeseer.ist.psu.edu/brandes01faster.html}, year = 2001 }