%0 Journal Article %1 Brandes2008136 %A Brandes, Ulrik %D 2008 %J Social Networks %K algorithms betweenness centrality networks %N 2 %P 136 - 145 %R http://dx.doi.org/10.1016/j.socnet.2007.11.001 %T On variants of shortest-path betweenness centrality and their generic computation %U http://www.sciencedirect.com/science/article/pii/S0378873307000731 %V 30 %X 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.

@article{Brandes2008136, 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. }, added-at = {2016-10-12T16:39:55.000+0200}, author = {Brandes, Ulrik}, biburl = {https://www.bibsonomy.org/bibtex/26c545c59b722d2ee05d4b3ac2de06a54/mbockholt}, description = {On variants of shortest-path betweenness centrality and their generic computation}, doi = {http://dx.doi.org/10.1016/j.socnet.2007.11.001}, interhash = {33a06386afdb5fe981eb7de0f61e591b}, intrahash = {6c545c59b722d2ee05d4b3ac2de06a54}, issn = {0378-8733}, journal = {Social Networks }, keywords = {algorithms betweenness centrality networks}, number = 2, pages = {136 - 145}, timestamp = {2016-11-11T09:26:44.000+0100}, title = {On variants of shortest-path betweenness centrality and their generic computation }, url = {http://www.sciencedirect.com/science/article/pii/S0378873307000731}, volume = 30, year = 2008 }