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

被引：604

作者：

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

共 33 条

[1]

[Anonymous], 2002, ALGORITHM DESIGN

[2]

Anthonisse J.M, 1971, 971 BN

[3]

Bollobas B., 1998, GRAD TEXT M, V184, DOI 10.1007/978-1-4612-0619-4_7

[4] Centrality and network flow [J].

Borgatti, SP .

SOCIAL NETWORKS, 2005, 27 (01) :55-71

[5] A graph-theoretic perspective on centrality [J].

Borgatti, Stephen P. ;

Everett, Martin G. .

SOCIAL NETWORKS, 2006, 28 (04) :466-484

[6]

Brandes U, 2005, LECT NOTES COMPUT SC, V3404, P533

[7] A faster algorithm for betweenness centrality [J].

Brandes, U .

JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177

[8]

BRANDES U, 2005, NETWORK ANAL LECT NO, V3418

[9] Centrality estimation in large networks [J].

Brandes, Ulrik ;

Pich, Christian .

INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2007, 17 (07) :2303-2318

[10]

Cormen T. H., 2001, Introduction to Algorithms, V2nd

← 1 2 3 4 →