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 条
  • [41] Two betweenness centrality measures based on Randomized Shortest Paths
    Ilkka Kivimäki
    Bertrand Lebichot
    Jari Saramäki
    Marco Saerens
    Scientific Reports, 6
  • [42] EUCLIDEAN SHORTEST-PATH IN THE PRESENCE OF OBSTACLES
    CHEN, YM
    RAMANAN, P
    NETWORKS, 1991, 21 (03) : 257 - 265
  • [43] A new algorithm for the shortest-path problem
    Elmasry, Amr
    Shokry, Ahmed
    NETWORKS, 2019, 74 (01) : 16 - 39
  • [44] Optimal routing in shortest-path data
    Ramakrishnan, KG
    Rodrigues, MA
    BELL LABS TECHNICAL JOURNAL, 2001, 6 (01) : 117 - 138
  • [45] AN EMPIRICAL SURVEY OF SHORTEST-PATH ALGORITHMS
    MOFFAT, A
    NEW ZEALAND OPERATIONAL RESEARCH, 1983, 11 (02): : 153 - 163
  • [46] CLUSTER AGGREGATION BY SHORTEST-PATH TRAVEL
    MANNA, SS
    CHAKRABARTI, BK
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1986, 19 (08): : L447 - L450
  • [47] SHORTEST-PATH METHODS - A UNIFYING APPROACH
    GALLO, G
    PALLOTTINO, S
    MATHEMATICAL PROGRAMMING STUDY, 1986, 26 : 38 - 64
  • [48] SHORTEST-PATH ALGORITHMS - TAXONOMY AND ANNOTATION
    DEO, N
    PANG, CY
    NETWORKS, 1984, 14 (02) : 275 - 323
  • [49] FASTER ALGORITHMS FOR THE SHORTEST-PATH PROBLEM
    AHUJA, RK
    MEHLHORN, K
    ORLIN, JB
    TARJAN, RE
    JOURNAL OF THE ACM, 1990, 37 (02) : 213 - 223
  • [50] A NOTE ON FINDING SHORTEST-PATH TREES
    KERSHENBAUM, A
    NETWORKS, 1981, 11 (04) : 399 - 400
12345