Analysis and performance results of computing betweenness centrality on IBM Cyclops64-Reference-Cited by-同舟云学术

Analysis and performance results of computing betweenness centrality on IBM Cyclops64

Published:2009-11-13 Issue:1 Volume:56 Page:1-24
ISSN:0920-8542
Container-title:The Journal of Supercomputing
language:en
Short-container-title:J Supercomput

Author:

Tan Guangming,Sreedhar Vugranam C.,Gao Guang R.

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11227-009-0339-9.pdf

Reference36 articles.

1. Alderson D, Doyle JC, Li L, Willinger W (2005) Towards a theory of scale-free graphs: definition, properties, and implications. Internet Math 2(4):431–523

2. Bader DA (2006) Hpcs scalable synthetic compact applications 2 graph analysis. www.highproductivity.org/SSCABmks.htm

3. Bader DA, Madduri K (2006) Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2. In: The 35th international conference on parallel processing (ICPP 2006)

4. Bader DA, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. In: The 35th international conference on parallel processing (ICPP 2006)

5. Brandes U (2001) A faster algorithm for betweenness centrality. J Math Social 25(2):163–177

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality;2022 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP);2022-03

2. A round-efficient distributed betweenness centrality algorithm;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming;2019-02-16

3. Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality;ACM Journal of Experimental Algorithmics;2018-11-15

4. Scaling betweenness centrality using communication-efficient sparse matrix multiplication;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2017-11-12

5. Articulation points guided redundancy elimination for betweenness centrality;ACM SIGPLAN Notices;2016-11-09