Faster Evaluation of Shortest-Path Based Centrality Indices

Cite This

Files in this item

Checksum: MD5:9a3a78bd834585b186a678251e00177f

BRANDES, Ulrik, 2000. Faster Evaluation of Shortest-Path Based Centrality Indices

@unpublished{Brandes2000Faste-6062, title={Faster Evaluation of Shortest-Path Based Centrality Indices}, year={2000}, author={Brandes, Ulrik} }

Faster Evaluation of Shortest-Path Based Centrality Indices Brandes, Ulrik 2011-03-24T16:09:05Z terms-of-use Brandes, Ulrik eng 2011-03-24T16:09:05Z Centrality indices are an important tool in network analysis, and many of them are derived from the set of all shortest paths of the underlying graph. The so-called betweenness centrality index is essential for the analysis of social networks, but most costly to compute. Currently, the fastest known algorithms require O(n3) time and O(n2) space, where n is the number of vertices.<br /><br />Motivated by the fast-growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They require O(n+m) space and run in O(n(m + n)) or O(n(m+nlog n)) time on unweighted or weighted graphs, respectively, where m is the number of edges. Since these algorithms simply augment single-source shortest-paths computations, all standard centrality indices based on shortest paths can now be computed uniformly in one framework. Experimental evidence is provided that this substantially increases the range of networks for which centrality analysis is feasible. application/pdf 2000

Downloads since Oct 1, 2014 (Information about access statistics)

preprint_120.pdf 193

This item appears in the following Collection(s)

Search KOPS


My Account