On variants of shortest-path betweenness centrality and their generic computation-Reference-Cited by-同舟云学术

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

Published:2008-05 Issue:2 Volume:30 Page:136-145
ISSN:0378-8733
Container-title:Social Networks
language:en
Short-container-title:Social Networks

Author:

Brandes Ulrik

Publisher

Elsevier BV

Subject

General Psychology,General Social Sciences,Sociology and Political Science,Anthropology

Reference34 articles.

1. Anthonisse, J. M., October 1971. The rush in a directed graph. Tech. Rep. BN 9/71, Stichting Mathematisch Centrum, 2e Boerhaavestraat 49 Amsterdam.

2. Modern Graph Theory of Graduate Texts in Mathematics, vol. 184;Bollobás,1998

3. Centrality and network flow;Borgatti;Social Networks,2005

4. A graph-theoretic perspective on centrality;Borgatti;Social Networks,2006

5. A faster algorithm for betweenness centrality;Brandes;Journal of Mathematical Sociology,2001

Cited by 632 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The role of link redundancy and structural heterogeneity in network disintegration;Expert Systems with Applications;2024-12

2. A temporal information transfer network approach considering federal funds rate for an interpretable asset fluctuation prediction framework;International Review of Economics & Finance;2024-11

3. A framework for using event evolutionary graphs to rapidly assess the vulnerability of urban flood cascade compound disaster event networks;Journal of Hydrology;2024-10

4. Node and edge centrality based failures in multi-layer complex networks;Journal of Computational Science;2024-10

5. ASM variants in the spotlight: A structure-based atlas for unraveling pathogenic mechanisms in lysosomal acid sphingomyelinase;Biochimica et Biophysica Acta (BBA) - Molecular Basis of Disease;2024-10