A faster algorithm for betweenness centrality Export

@misc{citeulike:297939, 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.}, author = {Brandes, U.}, citeulike-article-id = {297939}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024}, keywords = {betweenness, community, graph, network, social, structure}, posted-at = {2007-08-10 21:17:37}, priority = {2}, title = {A faster algorithm for betweenness centrality}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024}, year = {2001} }

TY - GEN ID - citeulike:297939 L3 - citeulike-article-id:297939 N2 - 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. TI - A faster algorithm for betweenness centrality KW - betweenness KW - community KW - graph KW - network KW - social KW - structure AU - Brandes, U PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024 ER -