%0 Journal Article %1 brandes2001faster %A Brandes, U. %D 2001 %J Journal of Mathematical Sociology %K betweenness_centrality fast %N 2 %P 163--177 %T A faster algorithm for betweenness centrality %U http://citeseer.ist.psu.edu/brandes01faster.html %V 25 %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.

@article{brandes2001faster, 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 = {2011-01-28T11:34:35.000+0100}, author = {Brandes, U.}, biburl = {https://www.bibsonomy.org/bibtex/289019a800a0250d69afda3d11be16196/dbenz}, id = {297939}, interhash = {dff547c1a86412c8f3742aab68f7a243}, intrahash = {89019a800a0250d69afda3d11be16196}, journal = {Journal of Mathematical Sociology}, keywords = {betweenness_centrality fast}, number = 2, pages = {163--177}, priority = {2}, timestamp = {2013-07-31T15:39:42.000+0200}, title = {A faster algorithm for betweenness centrality}, url = {http://citeseer.ist.psu.edu/brandes01faster.html}, volume = 25, year = 2001 }