Edge v. Node Parallelism for Graph Centrality Metrics

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[3]  Jiawei Han,et al.  Mining scale-free networks using geodesic clustering , 2004, KDD.

[4]  Hawoong Jeong,et al.  Scale-free trees: the skeletons of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Leon Peeters,et al.  Algorithms for Centrality Indices , 2004, Network Analysis.

[6]  David A. Bader,et al.  Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[7]  Michael Garland,et al.  On the Visualization of Social and other Scale-Free Networks , 2008, IEEE Transactions on Visualization and Computer Graphics.

[8]  Dengbiao Tu,et al.  Characterizing Betweenness Centrality Algorithm on Multi-core Architectures , 2009, 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[9]  John Hart,et al.  Hierarchical Edge Bundles for General Graphs , 2009 .

[10]  John E. Stone,et al.  GPU clusters for high-performance computing , 2009, 2009 IEEE International Conference on Cluster Computing and Workshops.

[11]  P. J. Narayanan,et al.  Large Graph Algorithms for Massively Multithreaded Architectures , 2009 .

[12]  David A. Bader,et al.  National Laboratory Lawrence Berkeley National Laboratory Title A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets Permalink , 2009 .

[13]  Wu-chun Feng,et al.  Inter-block GPU communication via fast barrier synchronization , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).