Betweenness Centrality : Algorithms and Lower Bounds
Data Structures and Algorithms
2008-10-19 v2
Abstract
One of the most fundamental problems in large scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely used metric to measure the importance of a node in a network. In this paper, we present a randomized parallel algorithm and an algebraic method for computing betweenness centrality of all nodes in a network. We prove that any path-comparison based algorithm cannot compute betweenness in less than O(nm) time.
Cite
@article{arxiv.0809.1906,
title = {Betweenness Centrality : Algorithms and Lower Bounds},
author = {Shiva Kintali},
journal= {arXiv preprint arXiv:0809.1906},
year = {2008}
}