{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:40:02Z","timestamp":1749768002297,"version":"3.41.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501260"},{"type":"electronic","value":"9783319501277"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-50127-7_21","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T01:04:06Z","timestamp":1480381446000},"page":"255-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures"],"prefix":"10.1007","author":[{"given":"Yi","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengqian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongjie","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lian","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,29]]},"reference":[{"issue":"8","key":"21_CR1","doi-asserted-by":"publisher","first-page":"e104993","DOI":"10.1371\/journal.pone.0104993","volume":"9","author":"B Amgalan","year":"2014","unstructured":"Amgalan, B., Lee, H.: Wmaxc: a weighted maximum clique method for identifying condition-specific sub-network. PLoS ONE 9(8), e104993 (2014)","journal-title":"PLoS ONE"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02243394","volume":"52","author":"L Babel","year":"1994","unstructured":"Babel, L.: A fast algorithm for the maximum weight clique problem. Computing 52(1), 31\u201338 (1994). http:\/\/dx.doi.org\/10.1007\/BF02243394","journal-title":"Computing"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-0-387-30165-5_30","volume-title":"Handbook of Optimization in Telecommunications","author":"B Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865\u2013890. Springer, Heidelberg (2006)"},{"key":"21_CR4","volume-title":"Computer Vision","author":"DH Ballard","year":"1982","unstructured":"Ballard, D.H., Brown, C.M.: Computer Vision, 1st edn. Prentice Hall Professional Technical Reference, New York (1982)","edition":"1"},{"issue":"5439","key":"21_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). http:\/\/www.sciencemag.org\/cgi\/content\/abstract\/286\/5439\/509","journal-title":"Science"},{"issue":"4","key":"21_CR6","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":"6","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/72.883403","volume":"11","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., Pelillo, M., Stix, V.: Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural Netw. Learn. Syst. 11(6), 1228\u20131241 (2000). http:\/\/dx.doi.org\/10.1109\/72.883403","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Brendel, W., Amer, M.R., Todorovic, S.: Multiobject tracking as maximum weight independent set. In: 24th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, Colorado Springs, CO, USA, 20\u201325 June 2011, pp. 1273\u20131280 (2011). http:\/\/dx.doi.org\/10.1109\/CVPR.2011.5995395","DOI":"10.1109\/CVPR.2011.5995395"},{"key":"21_CR9","unstructured":"Brendel, W., Todorovic, S.: Segmentation as maximum-weight independent set. In: Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6\u20139 December 2010, Vancouver, British Columbia, Canada, pp. 307\u2013315 (2010). http:\/\/papers.nips.cc\/paper\/3909-segmentation-as-maximum-weight-independent-set"},{"issue":"15","key":"21_CR10","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). http:\/\/dx.doi.org\/10.1016\/j.dam.2005.04.010","journal-title":"Discrete Appl. Math."},{"key":"21_CR11","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 747\u2013753 (2015). http:\/\/ijcai.org\/papers15\/Abstracts\/IJCAI15-111.html"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: Complex Graphs and Networks, vol. 107. American Mathematical Society (2006). https:\/\/books.google.com.au\/books?id=BqqDsEKlAE4C","DOI":"10.1090\/cbms\/107"},{"key":"21_CR13","unstructured":"Eubank, S., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, 11\u201314 January 2004, pp. 718\u2013727 (2004). http:\/\/dl.acm.org\/citation.cfm?id=982792.982902"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Fang, Z., Li, C., Qiao, K., Feng, X., Xu, K.: Solving maximum weight clique using maximum satisfiability reasoning. In: 21st European Conference on Artificial Intelligence, ECAI 2014, 18\u201322 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014), pp. 303\u2013308 (2014). http:\/\/dx.doi.org\/10.3233\/978-1-61499-419-0-303","DOI":"10.3233\/978-1-61499-419-0-303"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U Feige","year":"2005","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discret. Math. 18(2), 219\u2013225 (2005). http:\/\/dx.doi.org\/10.1137\/S089548010240415X","journal-title":"SIAM J. Discret. Math."},{"volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993","year":"1996","key":"21_CR16","unstructured":"Johnson, D.J., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993. American Mathematical Society, Boston (1996)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, 20\u201322 March 1972. At the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, pp. 85\u2013103 (1972). http:\/\/www.cs.berkeley.edu\/luca\/cs172\/karp.pdf","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"21_CR18","unstructured":"Li, N., Latecki, L.J.: Clustering aggregation as maximum-weight independent set. In: Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held 3\u20136 December 2012, Lake Tahoe, Nevada, United States, pp. 791\u2013799 (2012). http:\/\/papers.nips.cc\/paper\/4731-clustering-aggregation-as-maximum-weight-independent-set"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Ma, T., Latecki, L.J.: Maximum weight cliques with mutex constraints for video object segmentation. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA, 16\u201321 June 2012, pp. 670\u2013677 (2012). http:\/\/dx.doi.org\/10.1109\/CVPR.2012.6247735","DOI":"10.1109\/CVPR.2012.6247735"},{"issue":"3","key":"21_CR20","first-page":"193","volume":"9","author":"BL Miller","year":"1995","unstructured":"Miller, B.L., Goldberg, D.E.: Genetic algorithms, tournament selection, and the effects of noise. Complex Syst. 9(3), 193\u2013212 (1995)","journal-title":"Complex Syst."},{"issue":"4","key":"21_CR21","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A new algorithm for the maximum-weight clique problem. Nord. J. Comput. 8(4), 424\u2013436 (2001). http:\/\/www.cs.helsinki.fi\/njc\/References\/ostergard2001:424.html","journal-title":"Nord. J. Comput."},{"issue":"2","key":"21_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"WJ Pullan","year":"2008","unstructured":"Pullan, W.J.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heuristics 14(2), 117\u2013134 (2008). http:\/\/dx.doi.org\/10.1007\/s10732-007-9026-2","journal-title":"J. Heuristics"},{"issue":"9","key":"21_CR23","doi-asserted-by":"publisher","first-page":"e3111","DOI":"10.1371\/journal.pone.0003111","volume":"3","author":"MG Ravetti","year":"2008","unstructured":"Ravetti, M.G., Moscato, P.: Identification of a 5-protein biomarker molecular signature for predicting alzheimer\u2019s disease. PLoS ONE 3(9), e3111 (2008)","journal-title":"PLoS ONE"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s13278-014-0228-y","volume":"4","author":"RA Rossi","year":"2014","unstructured":"Rossi, R.A., Ahmed, N.K.: Coloring large complex networks. Soc. Netw. Analys. Min. 4(1), 228 (2014). http:\/\/dx.doi.org\/10.1007\/s13278-014-0228-y","journal-title":"Soc. Netw. Analys. Min."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.A.: Fast maximum clique algorithms for large graphs. In: 23rd International World Wide Web Conference, WWW 2014, Seoul, Republic of Korea, 7\u201311 April 2014, Companion Volume, pp. 365\u2013366 (2014). http:\/\/doi.acm.org\/10.1145\/2567948.2577283","DOI":"10.1145\/2567948.2577283"},{"key":"21_CR27","unstructured":"Wang, Y., Cai, S., Yin, M.: Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 12\u201317 February 2016, Phoenix, Arizona, USA, pp. 805\u2013811 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/11915"},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","volume":"196","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J., Glover, F.: Multi-neighborhood tabu search for the maximum weight clique problem. Ann. OR 196(1), 611\u2013634 (2012). http:\/\/dx.doi.org\/10.1007\/s10479-012-1124-3","journal-title":"Ann. OR"},{"key":"21_CR29","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A simple model to generate hard satisfiable instances. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 337\u2013342. Morgan Kaufmann Publishers Inc., San Francisco (2005). http:\/\/dl.acm.org\/citation.cfm?id=1642293.1642347"},{"key":"21_CR30","unstructured":"Yamaguchi, K., Masuda, S.: A new exact algorithm for the maximum weight clique problem. In: ITC-CSCC: 2008, pp. 317\u2013320 (2008)"}],"container-title":["Lecture Notes in Computer Science","AI 2016: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50127-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:25:32Z","timestamp":1749767132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50127-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501260","9783319501277"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50127-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"29 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hobart, TAS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ai2016.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}