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

被引：600
|
作者：
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 条
  • [31] 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
  • [32] Effective Co-betweenness Centrality Computation
    Chehreghani, Mostafa Haghir
    WSDM'14: PROCEEDINGS OF THE 7TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2014, : 423 - 432
  • [33] Simple and Fast Distributed Computation of Betweenness Centrality
    Crescenzi, Pierluigi
    Fraigniaud, Pierre
    Paz, Ami
    IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2020, : 337 - 346
  • [34] Performance Analysis of an Algorithm for Computation of Betweenness Centrality
    Bhardwaj, Shivam
    Niyogi, Rajdeep
    Milani, Alfredo
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2011, PT V, 2011, 6786 : 537 - 546
  • [35] Heuristics for Speeding up Betweenness Centrality Computation
    Puzis, Rami
    Zilberman, Polina
    Elovici, Yuval
    Dolev, Shlomi
    Brandes, Ulrik
    PROCEEDINGS OF 2012 ASE/IEEE INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY, RISK AND TRUST AND 2012 ASE/IEEE INTERNATIONAL CONFERENCE ON SOCIAL COMPUTING (SOCIALCOM/PASSAT 2012), 2012, : 302 - 311
  • [36] Shortest-Path Percolation on Random Networks
    Kim, Minsuk
    Radicchi, Filippo
    Physical Review Letters, 2024, 133 (04)
  • [37] A NOTE ON THE CONSTRAINED SHORTEST-PATH PROBLEM
    PUJARI, AK
    AGARWAL, S
    GULATI, VP
    NAVAL RESEARCH LOGISTICS, 1984, 31 (01) : 87 - 89
  • [38] THE EQUITY CONSTRAINED SHORTEST-PATH PROBLEM
    GOPALAN, R
    BATTA, R
    KARWAN, MH
    COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) : 297 - 307
  • [39] UNIVERSAL BEHAVIOR OF THE SHORTEST-PATH AGGREGATION
    WANG, XR
    WANG, XF
    PHYSICAL REVIEW A, 1992, 45 (02): : 1274 - 1277
  • [40] EFFICIENT SHORTEST-PATH SIMPLEX ALGORITHMS
    GOLDFARB, D
    HAO, JX
    KAI, SR
    OPERATIONS RESEARCH, 1990, 38 (04) : 624 - 628
12345