Edge v. Node Parallelism for Graph Centrality Metrics
Yuntao Jia, Victor Lu, Jared Hoberock et al. · Elsevier eBooks · 2011
Cited by 65 works. doi:10.1016/b978-0-12-385963-1.00002-2
Authors
References
- Emergence of Scaling in Random Networks
- A faster algorithm for betweenness centrality*
- Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
- Inter-block GPU communication via fast barrier synchronization
- GPU clusters for high-performance computing
- Proceedings. 2005 International Conference on Parallel Processing
- A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
- Scale-free trees: The skeletons of complex networks
- Mining scale-free networks using geodesic clustering
- Large Graph Algorithms for Massively Multithreaded Architectures