{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T23:22:05Z","timestamp":1746314525582,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412776"},{"type":"electronic","value":"9783642412783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41278-3_42","type":"book-chapter","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T13:41:50Z","timestamp":1381930910000},"page":"342-349","source":"Crossref","is-referenced-by-count":9,"title":["Graph-Based Substructure Pattern Mining Using CUDA Dynamic Parallelism"],"prefix":"10.1007","author":[{"given":"Fei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jianqiang","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. ACM SIGMOD Record\u00a022(2), 207\u2013216 (1993)","journal-title":"ACM SIGMOD Record"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Parthasarathy, S., Nguyen, A., et al.: Parallel Graph Mining on Shared Memory Architectures. Technical report, The Ohio State University (2005)","DOI":"10.1109\/ICDM.2006.15"},{"key":"42_CR3","unstructured":"CUDA C Programming Guide, NVIDIA Corporation (2012), http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html"},{"key":"42_CR4","unstructured":"Freeman, J.: Parallel Algorithms for Depth-First Search. Technical report (1991)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In: 3rd IEEE International Conference on Data Mining, pp. 549\u2013552 (2003)","DOI":"10.1145\/1014052.1014123"},{"key":"42_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"42_CR7","unstructured":"Kepler GK110 Architecture Whitepaper, NVIDIA Corporation (2013), http:\/\/www.nvidia.com\/content\/PDF\/kepler\/NVIDIA-Kepler-GK110-Architecture-Whitepaper.pdf"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: 2001 IEEE International Conference on Data Mining, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"42_CR9","unstructured":"Mannilla, H., Toivonen, H., Verkamo, I.: Discovering Frequent Episodes in Sequences. In: 1st International Conference on Knowledge Discovery and Data Mining, pp. 210\u2013215 (1995)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A Quickstart in Frequent Structure Mining Can Make a Difference. In: 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S. Nijssen","year":"2005","unstructured":"Nijssen, S., Kok, J.N.: The Gaston Tool for Frequent Subgraph Mining. Electronic Notes in Theoretical Computer Science\u00a0127(1), 77\u201387 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"42_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-45640-6_5","volume-title":"WEBKDD 2001 - Mining Web Log Data Across All Customers Touch Points","author":"J.R. Punin","year":"2002","unstructured":"Punin, J.R., Krishnamoorthy, M.S., Zaki, M.J.: LOGML: Log Markup Language for Web Usage Mining. In: Kohavi, R., Masand, B., Spiliopoulou, M., Srivastava, J. (eds.) WebKDD 2001. LNCS (LNAI), vol.\u00a02356, pp. 88\u2013112. Springer, Heidelberg (2002)"},{"key":"42_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45490-X_6","volume-title":"Web Intelligence: Research and Development","author":"P. Raghavan","year":"2001","unstructured":"Raghavan, P.: Social Networks on the Web and in the Enterprise. In: Zhong, N., Yao, Y., Ohsuga, S., Liu, J. (eds.) WI 2001. LNCS (LNAI), vol.\u00a02198, pp. 58\u201360. Springer, Heidelberg (2001)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Wang, C., Parthasarathy, S.: Parallel Algorithms for Mining Frequent Structural Motifs in Scientific Data. In: 18th ACM International Conference on Supercomputing, pp. 31\u201340 (2004)","DOI":"10.1145\/1006209.1006215"},{"issue":"2","key":"42_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MM.2011.24","volume":"31","author":"C.M. Wittenbrink","year":"2011","unstructured":"Wittenbrink, C.M., Kilgariff, E., Prabhu, A.: Fermi GF100 GPU Architecture. IEEE Micro\u00a031(2), 50\u201359 (2011)","journal-title":"IEEE Micro"},{"key":"42_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11564126_39","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"M. W\u00f6rlein","year":"2005","unstructured":"W\u00f6rlein, M., Meinl, T., Fischer, I., Philippsen, M.: A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 392\u2013403. Springer, Heidelberg (2005)"},{"key":"42_CR17","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: 2002 International Conference on Data Mining, pp. 721\u2013724 (2002)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41278-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:17:15Z","timestamp":1746033435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41278-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412776","9783642412783"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41278-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}