Betweenness Centrality – Incremental and Faster
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 577-588
Abstract
No abstract availableKeywords
All Related Versions
This publication has 31 references indexed in Scilit:
- A Faster Algorithm to Update Betweenness Centrality after Node Alteration2013
- Forensic analysis of phone call networksSocial Network Analysis and Mining, 2012
- Better Approximation of Betweenness Centrality2008
- Approximating Betweenness Centrality2007
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph AlgorithmsSIAM Journal on Computing, 2007
- A new approach to dynamic all pairs shortest pathsJournal of the ACM, 2004
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977