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

被引：574
|
作者：
Brandes, Ulrik [1 ]
机构：
[1] Univ Konstanz, Dept Comp & Informat Sci, Constance, Germany
来源：
SOCIAL NETWORKS | 2008年 / 30卷 / 02期
关键词：
betweenness centrality; algorithms; valued networks; load centrality;
D O I：
10.1016/j.socnet.2007.11.001
中图分类号：
Q98 [人类学];
学科分类号：
030303 ;
摘要：
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.
引用
收藏
页码：136 / 145
页数：10
相关论文
共 50 条
  • [21] Dynamic Shortest-Path Interdiction
    Sefair, Jorge A.
    Smith, J. Cole
    NETWORKS, 2016, 68 (04) : 315 - 330
  • [22] A BICRITERION SHORTEST-PATH ALGORITHM
    CLIMACO, JCN
    MARTINS, EQV
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (04) : 399 - 404
  • [23] SHORTEST-PATH ALGORITHMS - COMPARISON
    GOLDEN, B
    OPERATIONS RESEARCH, 1976, 24 (06) : 1164 - 1168
  • [24] Shortest-path kernels on graphs
    Borgwardt, KM
    Kriegel, HP
    Fifth IEEE International Conference on Data Mining, Proceedings, 2005, : 74 - 81
  • [25] Field programmable gate array-based acceleration of shortest-path computation
    Jagadeesh, G. R.
    Srikanthan, T.
    Lim, C. M.
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2011, 5 (04): : 231 - 237
  • [26] Betweenness in graphs: A short survey on shortest and induced path betweenness
    Changat, Manoj
    Narasimha-Shenoi, Prasanth G.
    Seethakuttyamma, Geetha
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2019, 16 (01) : 96 - 109
  • [27] The shortest-path computation in MOSPF protocol through an annealed chaotic neural network
    Lin, J.-S.
    Liu, M.
    Huang, N.-F.
    Proceedings of the National Science Council, Republic of China, Part A: Physical Science and Engineering, 2000, 24 (06): : 463 - 471
  • [28] An Efficient Algorithm for Approximate Betweenness Centrality Computation
    Chehreghani, Mostafa Haghir
    PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 1489 - 1492
  • [29] An Efficient Algorithm for Approximate Betweenness Centrality Computation
    Chehreghani, Mostafa Haghir
    COMPUTER JOURNAL, 2014, 57 (09): : 1371 - 1382
  • [30] Topology manipulations for speeding betweenness centrality computation
    Puzis, R.
    Elovici, Y.
    Zilberman, P.
    Dolev, S.
    Brandes, U.
    JOURNAL OF COMPLEX NETWORKS, 2015, 3 (01) : 84 - 112
12345