NETAL: HIGH-PERFORMANCE IMPLEMENTATION OF NETWORK ANALYSIS LIBRARY CONSIDERING COMPUTER MEMORY HIERARCHY( SCOPE (Seminar on Computation and OPtimization for new Extensions))
作者： Yuichiro Yasui , Katsuki Fujisawa , Kazushige Goto , Naoyuki Kamiyama , Mizuyo Takamatsu
关键词:
摘要:
elsevier.com
sci-hub.se 参考文章(19)
Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan, R-MAT: A Recursive Model for Graph Mining siam international conference on data mining. pp. 442- 446 ,(2004)
Pawan Harish, P. J. Narayanan, Accelerating Large Graph Algorithms on the GPU Using CUDA High Performance Computing – HiPC 2007. pp. 197- 208 ,(2007) , 10.1007/978-3-540-77220-0_21
Andrew V. Goldberg, A Simple Shortest Path Algorithm with Linear Average Time european symposium on algorithms. pp. 230- 241 ,(2001) , 10.1007/3-540-44676-1_19
John L. Hennessy, David A. Patterson, Computer Architecture: A Quantitative Approach ,(1989)
Gert Sabidussi, The centrality index of a graph Psychometrika. ,vol. 31, pp. 581- 603 ,(1966) , 10.1007/BF02289527
Linton C. Freeman, A Set of Measures of Centrality Based on Betweenness Sociometry. ,vol. 40, pp. 35- 41 ,(1977) , 10.2307/3033543
Alfonso Shimbel, Structural parameters of communication networks The Bulletin of Mathematical Biophysics. ,vol. 15, pp. 501- 507 ,(1953) , 10.1007/BF02476438
David Ediger, Karl Jiang, Jason Riedy, David A Bader, Courtney Corley, Rob Farber, William N Reynolds, Massive Social Network Analysis: Mining Twitter for Social Good international conference on parallel processing. pp. 583- 593 ,(2010) , 10.1109/ICPP.2010.66
Per Hage, Frank Harary, Eccentricity and centrality in networks Social Networks. ,vol. 17, pp. 57- 63 ,(1995) , 10.1016/0378-8733(94)00248-9
Ulrik Brandes, On variants of shortest-path betweenness centrality and their generic computation ☆ Social Networks. ,vol. 30, pp. 136- 145 ,(2008) , 10.1016/J.SOCNET.2007.11.001