%0 Conference Paper %1 Brandes2001Faster %A Brandes, Ulrik %B Journal of Mathematical Sociology %D 2001 %J Journal of Mathematical Sociology %K networks algorithms betweenness %P 163--177 %T A Faster Algorithm for Betweenness Centrality %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024 %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.

@inproceedings{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 = {2019-06-10T14:53:09.000+0200}, author = {Brandes, Ulrik}, biburl = {https://www.bibsonomy.org/bibtex/2a4d925bcd5f7479d28ca200c1f92ac06/nonancourt}, booktitle = {Journal of Mathematical Sociology}, citeulike-article-id = {3404989}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024}, interhash = {dff547c1a86412c8f3742aab68f7a243}, intrahash = {a4d925bcd5f7479d28ca200c1f92ac06}, journal = {Journal of Mathematical Sociology}, keywords = {networks algorithms betweenness}, pages = {163--177}, posted-at = {2008-10-14 17:12:07}, priority = {2}, timestamp = {2019-08-26T11:18:50.000+0200}, title = {{A Faster Algorithm for Betweenness Centrality}}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024}, volume = 25, year = 2001 }