{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:49:21Z","timestamp":1753440561158,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T00:00:00Z","timestamp":1537747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["DEC-2011\/03\/D\/NZ2\/02004"],"award-info":[{"award-number":["DEC-2011\/03\/D\/NZ2\/02004"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10732-018-9393-x","type":"journal-article","created":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T01:47:21Z","timestamp":1537753641000},"page":"247-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Implementation of a maximum clique search procedure on CUDA"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2316-6586","authenticated-orcid":false,"given":"Pawe\u0142","family":"Daniluk","sequence":"first","affiliation":[]},{"given":"Grzegorz","family":"Firlik","sequence":"additional","affiliation":[]},{"given":"Bogdan","family":"Lesyng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,24]]},"reference":[{"issue":"1","key":"9393_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"4","key":"9393_CR2","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R Battiti","year":"2001","unstructured":"Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610\u2013637 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"9393_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B.: The chromatic number of random graphs. Combinatorica 8(1), 49\u201355 (1988)","journal-title":"Combinatorica"},{"key":"9393_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-1-4613-3279-4_4","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization. Applied Optimization","author":"IM Bomze","year":"1998","unstructured":"Bomze, I.M., Rendl, F.: Replicator dynamics for evolution towards the maximum clique: variations and experiments. In: Leone, R.D., Murli, A., Pardalos, P.M., Toraldo, G. (eds.) High Performance Algorithms and Software in Nonlinear Optimization. Applied Optimization, vol. 24, pp. 53\u201367. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"1","key":"9393_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(01)00233-5","volume":"121","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., Budinich, M., Pelillo, M., Rossi, C.: Annealed replication: a new heuristic for the maximum clique problem. Discrete Appl. Math. 121(1), 27\u201349 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"15","key":"9393_CR6","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S Busygin","year":"2006","unstructured":"Busygin, S.: A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 154(15), 2080\u20132096 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9393_CR7","unstructured":"Cruz, R., L\u00f3pez, N., Trefftz, C.: Parallelizing a heuristic for the maximum clique problem on GPUs and clusters of workstations. In: IEEE International Conference on Electro\/Information Technology (EIT), 2013, pp. 1\u20136. IEEE (2013)"},{"issue":"9","key":"9393_CR8","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1021\/ci4002525","volume":"53","author":"M Depolli","year":"2013","unstructured":"Depolli, M., Konc, J., Rozman, K., Trobec, R., Jane\u017ei\u010d, D.: Exact parallel maximum clique algorithm for general and protein graphs. J. Chem. Inf. Model. 53(9), 2217\u20132228 (2013)","journal-title":"J. Chem. Inf. Model."},{"issue":"2","key":"9393_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"9393_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"key":"9393_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Berlin (1972)"},{"issue":"3","key":"9393_CR12","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc, J., Jane\u017ei\u010d, D.: An improved branch and bound algorithm for the maximum clique problem. MATCH Commun. Math. Comput. Chem. 58(3), 569\u2013590 (2007)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"9393_CR13","unstructured":"Matula, D.W.: The largest clique size in a random graph. Technical Report CS 7608, Department of Computer Science, Southern Methodist University (1976)"},{"issue":"4","key":"9393_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17(4), 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"3","key":"9393_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Glob. Optim. 4(3), 301\u2013328 (1994)","journal-title":"J. Glob. Optim."},{"key":"9393_CR16","doi-asserted-by":"crossref","unstructured":"Pattabiraman, B., Patwary, M.M.A., Gebremedhin, A.H., Liao, W.k., Choudhary, A.N.: Fast algorithms for the maximum clique problem on massive sparse graphs. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) Algorithms and Models for the Web Graph. Lecture Notes in Computer Science, vol. 8305, pp. 156\u2013169. Springer International Publishing, Cham (WAW 2013)","DOI":"10.1007\/978-3-319-03536-9_13"},{"key":"9393_CR17","doi-asserted-by":"crossref","unstructured":"Pavan, M., Pelillo, M.: Generalizing the Motzkin\u2013Straus theorem to edge-weighted graphs, with applications to image segmentation. In: Rangarajan, A., Figueiredo, M., Zerubia, J. (eds.) International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition. Lecture Notes in Computer Science, vol. 2683, pp. 485\u2013500. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-45063-4_31"},{"issue":"8","key":"9393_CR18","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11(8), 1933\u20131955 (1999)","journal-title":"Neural Comput."},{"key":"9393_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. J. Artif. Intell. Res. 25, 159\u2013185 (2006)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9393_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10732-010-9131-5","volume":"17","author":"W Pullan","year":"2011","unstructured":"Pullan, W., Mascia, F., Brunato, M.: Cooperating local search for the maximum clique problem. J. Heuristics 17(2), 181\u2013199 (2011)","journal-title":"J. Heuristics"},{"key":"9393_CR21","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.A., Ali, M.: A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components, pp. 1\u20139 (2013). arXiv preprint \n                    arXiv:1302.6256"},{"issue":"4","key":"9393_CR22","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Comput. 3(4), 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9393_CR23","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo, P., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9393_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(93)E0140-T","volume":"58","author":"LA Sanchis","year":"1995","unstructured":"Sanchis, L.A.: Generating hard and diverse test sets for NP-hard graph problems. Discrete Appl. Math. 58(1), 35\u201366 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9393_CR25","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10732-006-4295-8","volume":"12","author":"C Solnon","year":"2006","unstructured":"Solnon, C., Fenet, S.: A study of ACO capabilities for solving the maximum clique problem. J. Heuristics 12(3), 155\u2013180 (2006)","journal-title":"J. Heuristics"},{"key":"9393_CR26","doi-asserted-by":"crossref","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) Discrete Mathematics and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2731, pp. 278\u2013289. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45066-1_22"},{"issue":"1","key":"9393_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37(1), 95\u2013111 (2007)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"9393_CR28","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1587\/transinf.E96.D.1286","volume":"96","author":"E Tomita","year":"2013","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Trans. Inf. Syst. 96(6), 1286\u20131298 (2013)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"9393_CR29","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9393_CR30","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q Zhang","year":"2005","unstructured":"Zhang, Q., Sun, J., Tsang, E.: An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 9(2), 192\u2013200 (2005)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9393-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9393-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9393-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T19:13:23Z","timestamp":1569266003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9393-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,24]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9393"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9393-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2018,9,24]]},"assertion":[{"value":"19 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}