Regularizing graph centrality computations
Authors:
- Ahmet Erdem SarıyüceASAhmet Erdem Sarıyüce
- Erik SauleESErik Saule
- Kamer KayaKKKamer Kaya
- Ümit V. ÇatalyürekÜÇÜmit V. Çatalyürek
- 1 February 2015
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 76, 106-119
Abstract
No abstract availableKeywords
Funding Information
- Defense Threat Reduction Agency (HDTRA1-14-C-0007)
This publication has 24 references indexed in Scilit:
- Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi2014
- Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics2014
- STREAMER: A distributed framework for incremental closeness centrality computation2013
- Efficient sparse matrix-vector multiplication on x86-based many-core processors2013
- A task parallel algorithm for finding all-pairs shortest paths using the GPUInternational Journal of High Performance Computing and Networking, 2012
- The Combinatorial BLAS: design, implementation, and applicationsThe International Journal of High Performance Computing Applications, 2011
- Fast network centrality analysis using GPUsBMC Bioinformatics, 2011
- SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
- A hypergraph-partitioning approach for coarse-grain decomposition2001
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001