{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:41:10Z","timestamp":1743039670281,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031695827"},{"type":"electronic","value":"9783031695834"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-69583-4_7","type":"book-chapter","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:02:05Z","timestamp":1724612525000},"page":"88-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["QClique: Optimizing Performance and\u00a0Accuracy in\u00a0Maximum Weighted Clique"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3034-2825","authenticated-orcid":false,"given":"Qasim","family":"Abbas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7465-8003","authenticated-orcid":false,"given":"Mohsen Koohi","family":"Esfahani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1158-8527","authenticated-orcid":false,"given":"Ian","family":"Overton","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5868-9259","authenticated-orcid":false,"given":"Hans","family":"Vandierendonck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Wang, Y., et\u00a0al.: Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a030 (2016)","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00453-003-1074-x","volume":"38","author":"SP Fekete","year":"2004","unstructured":"Fekete, S.P., Meijer, H.: Maximum dispersion and geometric maximum weight cliques. Algorithmica 38, 501\u2013511 (2004)","journal-title":"Algorithmica"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103230","volume":"280","author":"Y Wang","year":"2020","unstructured":"Wang, Y., et al.: SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem. Artifi. Intelli. 280, 103230 (2020)","journal-title":"Artifi. Intelli."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Jiang, H., et\u00a0al.: An exact algorithm for the maximum weight clique problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a031 (2017)","DOI":"10.1609\/aaai.v31i1.10648"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2017.01.026","volume":"223","author":"S Shimizu","year":"2017","unstructured":"Shimizu, S., et al.: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound. Discret. Appl. Math. 223, 120\u2013134 (2017)","journal-title":"Discret. Appl. Math."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1613\/jair.4953","volume":"55","author":"Z Fang","year":"2016","unstructured":"Fang, Z., et al.: An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem. J. Artif. Intell. Res. 55, 799\u2013833 (2016)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR7","unstructured":"Cai, S., Lin, J.: Fast solving maximum weight clique problem in massive graphs. In: IJCAI, pp. 568\u2013574 (2016)"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Gendreau, M.: An introduction to Tabu search. Springer (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_2","DOI":"10.1007\/0-306-48056-5_2"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cie.2018.02.018","volume":"118","author":"HE Kiziloz","year":"2018","unstructured":"Kiziloz, H.E., Dokeroglu, T.: A robust and cooperative parallel Tabu search. Comput. Ind. Eng. 118, 54\u201366 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2021.100646","volume":"41","author":"S Shimizu","year":"2021","unstructured":"Shimizu, S., et al.: Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. Discret. Optim. 41, 100646 (2021)","journal-title":"Discret. Optim."},{"key":"7_CR11","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. Global Optim. 4, 301\u2013328 (1994)","journal-title":"J. Global Optim."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-03536-9_13","volume-title":"Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings","author":"B Pattabiraman","year":"2013","unstructured":"Pattabiraman, B., Patwary, M.M.A., Gebremedhin, A.H., Liao, W., Choudhary, A.: 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: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings, pp. 156\u2013169. Springer International Publishing, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03536-9_13"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1), 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s11590-013-0698-2","volume":"8","author":"A Buchanan","year":"2014","unstructured":"Buchanan, A., et al.: Solving maximum clique in sparse graphs: an o (nm+ n2 d\/4) o (nm+ n 2 d\/4) algorithm for d d-degenerate graphs. Optimi. Lett. 8, 1611\u20131617 (2014)","journal-title":"Optimi. Lett."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"7_CR16","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. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Vandierendonck, H.: Differentiating set intersections in maximal clique enumeration by function and subproblem size. In: Proceedings of the 38th ACM International Conference on Supercomputing: ICS 2024 (2024)","DOI":"10.1145\/3650200.3656607"},{"issue":"12","key":"7_CR18","doi-asserted-by":"publisher","first-page":"2676","DOI":"10.14778\/3407790.3407853","volume":"13","author":"J Blanu\u0161a","year":"2020","unstructured":"Blanu\u0161a, J., et al.: Manycore clique enumeration with fast set intersections. Proc. VLDB Endow. 13(12), 2676\u20132690 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"Prosser, P.: Exact algorithms for maximum clique: a computational study. Algorithms 5(4), 545\u2013587 (2012)","journal-title":"Algorithms"},{"issue":"5","key":"7_CR20","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1007\/s00500-019-04122-z","volume":"24","author":"E Sevinc","year":"2020","unstructured":"Sevinc, E., Dokeroglu, T.: A novel parallel local search algorithm for the maximum vertex weight clique. Soft. Comput. 24(5), 3551\u20133567 (2020)","journal-title":"Soft. Comput."},{"key":"7_CR21","unstructured":"Saad, Y.: Sparskit: a basic tool kit for sparse matrix computations (1994)"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46\u201355 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1090\/dimacs\/015\/21","volume":"15","author":"L Sanchis","year":"1994","unstructured":"Sanchis, L.: Test case construction for the vertex cover problem. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 15, 315\u2013326 (1994)","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"7_CR25","unstructured":"Jure, L., Andrej, K.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Brockington, M., Culberson, J.C.: Camouflaging independent sets in quasi-random graphs. Cliques, coloring, and satisfiability 26, 75\u201388 (1996)","DOI":"10.1090\/dimacs\/026\/05"},{"issue":"1","key":"7_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(93)E0140-T","volume":"58","author":"L Sanchis","year":"1995","unstructured":"Sanchis, L.: Generating hard and diverse test sets for NP-hard graph problems. Discret. Appl. Math. 58(1), 35\u201366 (1995)","journal-title":"Discret. Appl. Math."},{"issue":"10","key":"7_CR28","doi-asserted-by":"publisher","first-page":"2823","DOI":"10.3390\/cancers12102823","volume":"12","author":"I Overton","year":"2020","unstructured":"Overton, I., et al.: Functional transcription factor target networks illuminate control of epithelial remodelling. Cancers 12(10), 2823 (2020)","journal-title":"Cancers"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., McSherry, F.: Fast computation of low-rank matrix approximations. JACM 54(2), 9\u2013es (2007)","DOI":"10.1145\/1219092.1219097"},{"issue":"9","key":"7_CR30","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Comput. Oper. Res. 33(9), 2547\u20132562 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"7_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538902.1538905","volume":"56","author":"D Achlioptas","year":"2009","unstructured":"Achlioptas, D., et al.: On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. JACM 56(4), 1\u201328 (2009)","journal-title":"JACM"},{"key":"7_CR32","unstructured":"Hertz, A., et\u00a0al.: A tutorial on Tabu search. In: Proceedings of Giornate di Lavoro AIRO, vol.\u00a095, pp. 13\u201324 (1995)"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"El-Baz, D., et\u00a0al.: A parallel ant colony optimization for the maximum-weight clique problem. In: 2016 (IPDPSW), pp. 796\u2013800 (2016)","DOI":"10.1109\/IPDPSW.2016.111"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Lambora, A., et\u00a0al.: Genetic algorithm-a literature review. In: 2019 (COMITCon), pp. 380\u2013384. IEEE (2019)","DOI":"10.1109\/COMITCon.2019.8862255"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1613\/jair.1.12327","volume":"72","author":"S Cai","year":"2021","unstructured":"Cai, S., et al.: A semi-exact algorithm for quickly computing a maximum weight clique in large sparse graphs. JAIR 72, 39\u201367 (2021)","journal-title":"JAIR"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-69583-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:03:15Z","timestamp":1724612595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-69583-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031695827","9783031695834"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-69583-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}