{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:14:34Z","timestamp":1766578474182,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233968"},{"type":"electronic","value":"9783642233975"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23397-5_42","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T07:40:06Z","timestamp":1313653206000},"page":"425-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Lessons Learned from Exploring the Backtracking Paradigm on the GPU"],"prefix":"10.1007","author":[{"given":"John","family":"Jenkins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isha","family":"Arkatkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Owens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Choudhary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nagiza F.","family":"Samatova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th VLDB Conference, pp. 487\u2013499 (1994)"},{"key":"42_CR2","unstructured":"Bader, D.A., Madduri, K.: GTgraph: A suite of synthetic random graph generators, https:\/\/sdm.lbl.gov\/~kamesh\/software\/GTgraph\/"},{"issue":"9","key":"42_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM\u00a016(9), 575\u2013577 (1973)","journal-title":"Communications of the ACM"},{"key":"42_CR4","first-page":"442","volume-title":"SIAM International Conference on Data Mining","author":"D. Chakrabarti","year":"2004","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: SIAM International Conference on Data Mining, pp. 442\u2013446. SIAM, Philadelphia (2004)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Foley, T., Sugerman, J.: KD-Tree acceleration structures for a GPU raytracer. In: Graphics Hardware 2005, pp. 15\u201322 (July 2005)","DOI":"10.1145\/1071866.1071869"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proc. of the 2001 IEEE International Conference on Data Mining, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"issue":"3","key":"42_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1006\/jmbi.1993.1074","volume":"229","author":"H.M. Grindley","year":"1993","unstructured":"Grindley, H.M., Artymiuk, P.J., Rice, D.W., Willett, P.: Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. Journal of Molecular Biology\u00a0229(3), 707\u2013721 (1993)","journal-title":"Journal of Molecular Biology"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-77220-0_21","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"P. Harish","year":"2007","unstructured":"Harish, P., Narayanan, P.J.: Accelerating large graph algorithms on the GPU using CUDA. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol.\u00a04873, pp. 197\u2013208. Springer, Heidelberg (2007)"},{"key":"42_CR9","unstructured":"Havran, V.: Heuristic Ray Shooting Algorithms. PhD thesis, Czech Technical University in Prague (2001)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Horn, D., Sugerman, J., Houston, M., Hanrahan, P.: Interactive k-d tree GPU raytracing. In: Proc. of the 2007 Symposium on Interactive 3D Graphics and Games, pp. 167\u2013174 (2007)","DOI":"10.1145\/1230100.1230129"},{"issue":"1","key":"42_CR11","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for constraint-satisfaction problems: A survey. AI Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"AI Magazine"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Lee, V.W., Kim, C., et al.: Debunking the 100X GPU vs. CPU myth: An evaluation of throughput computing on CPU and GPU. In: Int\u2019l Symposium on Computer Architecture, pp. 451\u2013460 (2010)","DOI":"10.1145\/1816038.1816021"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J. Moon","year":"1965","unstructured":"Moon, J., Moser, W.: On cliques in graphs. Israel J. of Math.\u00a03, 23\u201328 (1965)","journal-title":"Israel J. of Math."},{"issue":"5","key":"42_CR14","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1109\/JPROC.2008.917757","volume":"96","author":"J.D. Owens","year":"2008","unstructured":"Owens, J.D., Houston, M., Luebke, D., Green, S., Stone, J.E., Phillips, J.C.: GPU computing. Proceedings of the IEEE\u00a096(5), 879\u2013899 (2008)","journal-title":"Proceedings of the IEEE"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Rowe, R., Creamer, G., Hershkop, S., Stolfo, S.J.: Automated social hierarchy detection through email network analysis. In: 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis (2007)","DOI":"10.1145\/1348549.1348562"},{"issue":"4","key":"42_CR16","first-page":"417","volume":"69","author":"M.C. Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., Thomas, K., Park, B.-H.: A scalable, parallel algorithm for maximal clique enumeration. JPDC\u00a069(4), 417\u2013428 (2009)","journal-title":"JPDC"},{"issue":"8","key":"42_CR17","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.jasms.2005.04.010","volume":"16","author":"D.L. Tabb","year":"2005","unstructured":"Tabb, D.L., Thompson, M.R., Khalsa-Moyers, G., VerBerkmoes, N.C., McDonald, W.H.: Ms2grouper: group assessment and synthetic replacement of duplicate proteomic tandem mass spectra. Journal of the American Society for Mass Spectrometry\u00a016(8), 1250\u20131261 (2005)","journal-title":"Journal of the American Society for Mass Spectrometry"},{"key":"42_CR18","unstructured":"Vuduc, R., Chandramowlishwaran, A., Choi, J., Guney, M., Shringarpure, A.: On the limits of GPU acceleration. Hot Topics in Paralellism\u00a035(5) (2010)"},{"issue":"7","key":"42_CR19","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1093\/bioinformatics\/btn036","volume":"24","author":"B. Zhang","year":"2008","unstructured":"Zhang, B., Park, B.-H., Karpinets, T., Samatova, N.F.: From pull-down data to protein interaction networks and complexes with biological relevance. Bioinformatics\u00a024(7), 979\u2013986 (2008)","journal-title":"Bioinformatics"},{"issue":"5","key":"42_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1409060.1409079","volume":"27","author":"K. Zhou","year":"2008","unstructured":"Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time KD-tree construction on graphics hardware. ACM Transactions on Graphics\u00a027(5), 1\u2013126 (2008)","journal-title":"ACM Transactions on Graphics"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23397-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T22:18:16Z","timestamp":1741472296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23397-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233968","9783642233975"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23397-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}