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

@article{brandes08on, abstract = {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.}, author = {Brandes, Ulrik }, citeulike-article-id = {2706950}, doi = {10.1016/j.socnet.2007.11.001}, journal = {Social Networks}, keywords = {algorithm, betweenness, centrality, networks, q-measure}, month = {May}, number = {2}, pages = {136--145}, posted-at = {2008-04-23 12:01:54}, priority = {2}, title = {On variants of shortest-path betweenness centrality and their generic computation}, url = {http://dx.doi.org/10.1016/j.socnet.2007.11.001}, volume = {30}, year = {2008} }

TY - JOUR ID - brandes08on L3 - citeulike-article-id:2706950 TI - On variants of shortest-path betweenness centrality and their generic computation JF - Social Networks VL - 30 IS - 2 SP - 136 EP - 145 N2 - 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. KW - algorithm KW - betweenness KW - centrality KW - networks KW - q-measure AU - Brandes, Ulrik PY - 2008/05// UR - http://dx.doi.org/10.1016/j.socnet.2007.11.001 ER -