QUBE: a quick algorithm for updating betweenness centrality
暂无分享,去创建一个
Ryan H. Choi | Chin-Wan Chung | Jungmin Lee | Jaimie Yejean Park | Min-Joong Lee | J. Y. Park | C. Chung | R. Choi | Min-Joong Lee | Jungmin Lee
[1] K. Norlen. 1 EVA : Extraction , Visualization and Analysis of the Telecommunications and Media Ownership Network , 2002 .
[2] Antonio del Sol,et al. Topology of small-world networks of protein?Cprotein complex structures , 2005, Bioinform..
[3] Mark E. J. Newman. A measure of betweenness centrality based on random walks , 2005, Soc. Networks.
[4] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[5] Petter Holme,et al. Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..
[6] Ulrik Brandes,et al. Centrality Estimation in Large Networks , 2007, Int. J. Bifurc. Chaos.
[7] A. Arenas,et al. Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[8] J. Anthonisse. The rush in a directed graph , 1971 .
[9] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[10] Loet Leydesdorff,et al. Betweenness centrality as an indicator of the interdisciplinarity of scientific journals , 2007, J. Assoc. Inf. Sci. Technol..
[11] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[12] David A. Bader,et al. Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).
[13] J. Pinney,et al. Betweenness-based decomposition methods for social and biological networks , 2006 .
[14] David A. Bader,et al. Approximating Betweenness Centrality , 2007, WAW.
[15] Pak Chung Wong,et al. A novel application of parallel betweenness centrality to power grid contingency analysis , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).
[16] L. Freeman,et al. Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .
[17] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[18] Dirk Helbing,et al. Scaling laws in the spatial structure of urban road networks , 2006 .
[19] Kurt Mehlhorn,et al. A Faster Algorithm for Minimum Cycle Basis of Graphs , 2004, ICALP.
[20] Ulrik Brandes,et al. On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.
[21] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..
[22] Marc Barthelemy,et al. Group betweenness and co-betweenness: Inter-related notions of coalition centrality , 2009, Soc. Networks.
[23] Peter Sanders,et al. Better Approximation of Betweenness Centrality , 2008, ALENEX.
[24] Leonard M. Freeman,et al. A set of measures of centrality based upon betweenness , 1977 .
[25] Yury Makarychev. Simple linear time approximation algorithm for betweenness , 2012, Oper. Res. Lett..