Author:
Sarıyüce Ahmet Erdem,Saule Erik,Kaya Kamer,Çatalyürek Ümit V.
Funder
NSF
Defense Threat Reduction Agency
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference33 articles.
1. V. Agarwal, F. Petrini, D. Pasetto, D.A. Bader, Scalable graph exploration on multicore processors, in: SuperComputing (SC), 2010, pp. 1–11.
2. M. Belgin, G. Back, C.J. Ribbens, Pattern-based sparse matrix representation for memory-efficient SMVM kernels, in: Proceedings of the 23rd International ACM Conference on International Conference on Supercomputing, ICS ’09, 2009, pp. 100–109.
3. Distributed processing of very large datasets with DataCutter;Beynon;Parallel Comput.,2001
4. A faster algorithm for betweenness centrality;Brandes;J. Math. Sociol.,2001
5. The combinatorial BLAS: design, implementation, and applications;Buluç;Int. J. High Perform. Comput. Appl. (IJHPCA),2011
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Closeness Centrality on Uncertain Graphs;ACM Transactions on the Web;2023-07-11
2. Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide;ACM Journal of Experimental Algorithmics;2022-12-13
3. An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality;2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD);2022-11
4. Postmortem Computation of Pagerank on Temporal Graphs;Proceedings of the 51st International Conference on Parallel Processing;2022-08-29
5. Centrality Measures: A Tool to Identify Key Actors in Social Networks;Principles of Social Networking;2021-08-19