다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
정보과학회. 컴퓨팅의 실제 논문지 = KIISE transactions on computing practices, v.23 no.3, 2017년, pp.156 - 164
손민영 (금오공과대학교 컴퓨터공학과) , 김영학 (금오공과대학교 컴퓨터공학과) , 최성자 (홍익대학교 경영학과)
AI-Helper
Measuring the similarity of two graphs is a basic tool to solve graph problems in various applications. Most graph algorithms have a high time complexity according to the number of vertices and edges. Because Graphics Processing Units (GPUs) have a high computational power and can be obtained at a l...
V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. V. Dooren, "A measure of similarity between graph vertices: Applications to synonym extraction and web searching," SIAM review, Vol. 46, No. 4, pp. 647-666, 2004.
P. J. Narayanan, "Processor Autonomy on SIMD Architectures," Int. Conf. on Supercomputing, pp. 127-136, 1993. (in USA)
G. J. Katz, and J. T. Kinder Jr, "All-pairs shortest- paths for large graphs on the GPU," Proc. of the 23rd ACM SIGGRAPH/EUROGRAPHICS Symp. on Graphics hardware, pp. 47-55, 2008. (in Switzerland)
K. Matsumoto, N. Nakasato, and S. G. Sedukhin, "Blocked all-pairs shortest paths algorithm for hybrid CPU-GPU system," High Performance Computing and Communications (HPCC), pp. 145-152, 2011. (in Canada)
D. Merrill, M. Garland, and A. Grimshaw, "Scalable GPU graph traversal," ACM SIGPLAN Notices, Vol. 47, No. 8, pp. 117-128, 2012.
P. Harish, V. Vineet, and P. J. Narayanan, "Large Graph Algorithms for Massively Multithreaded Architectures," Int. Institute of Information Technology Hyderabad, 2009. (in India)
R. Singh, J. Xu, and B. Berger, "Global alignment of multiple protein interaction networks with application to functional orthology detection," Proc. of the National Academy of Sciences, Vol. 105, No. 35, pp. 12763-12768, 2008.
C. Silverstein, S. Brin, and R. Motwani, "Beyond market baskets: Generalizing association rules to dependence rules," Data Min. Knowl. Discov., Vol. 2, No. 1, pp. 39-68, 1998.
R. Allen, L. Cinque, S. Tanimoto, L. Shapiro, and D. Yasuda, "A parallel algorithm for graph matching and its MasPar implementation," Parallel and Distributed Systems, IEEE Transactions on, Vol. 8, No. 5, pp. 490-501, 1997.
P. M. Pardalos, J. Rappe, and M.G.C. Resende, "An exact parallel algorithm for the maximum clique problem," High Performance and Software in Nonlinear Optimization, pp. 279-300. 1998.
Y. Shinano, T. Fujie, Y. Ikebe, and R. Hirabayashi, "Solving the maximum clique problem using PUBB," Parallel Processing Symposium, pp. 326-332, 1998.
G. Jeh and J. Widom, "SimRank: a measure of structural-context similarity," Proc. of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 538-543, 2002.
Guoming He, Haijun Feng, Cuiping Li, and Hong Chen, "Parallel SimRank computation on large graphs with iterative aggregation," Bharat Rao, Balaji Krishnapuram, Andrew Tomkins, and Qiang Yang, editors, Proc. of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 543-552, 2010. (in USA)
M.-Y. Son, Y.-H. Kim, and B.-W. Oh, "An Efficient parallel Algorithm for Graph Isomorphism on GPU using CUDA," Int. J. of Engineering and Technology (IJET), Vol. 7, No. 5, pp. 1840-1848, 2015.
J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," J. of the ACM (JACM), Vol. 46, No. 5, pp. 604-632, 1999.
S. Melnik, H. Garcia-Molina, and E. Rahm, "Similarity flooding: A versatile graph matching algorithm and its application to schema matching," Data Engineering, 2002. Proc. 18th Int. Conf. on. IEEE, pp. 117-128, 2002. (in USA)
R. A. Horn, and C. R. Johnson, Matrix analysis, Cambridge university press, 2012.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.