On variants of shortest-path betweenness centrality and their generic computation

Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case. (C) 2008 Elsevier B.V. All rights reserved.