Efficient Incremental Laplace Centrality Algorithm for Dynamic Networks
暂无分享,去创建一个
[1] Kathleen M. Carley,et al. Incremental closeness centrality for dynamically changing social networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).
[2] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[3] Cun-Quan Zhang,et al. Laplacian centrality: A new centrality measure for weighted networks , 2012, Inf. Sci..
[4] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[5] Cun-Quan Zhang,et al. Terrorist Networks, Network Energy and Node Removal: A New Measure of Centrality Based on Laplacian Energy , 2013 .
[6] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[7] Matteo Pontecorvi,et al. Betweenness Centrality - Incremental and Faster , 2013, MFCS.