{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T06:21:31Z","timestamp":1769062891939,"version":"3.49.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61403076"],"award-info":[{"award-number":["61403076"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61403077"],"award-info":[{"award-number":["61403077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402070"],"award-info":[{"award-number":["61402070"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370156"],"award-info":[{"award-number":["61370156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503074"],"award-info":[{"award-number":["61503074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2799953","type":"journal-article","created":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T19:22:47Z","timestamp":1518549767000},"page":"10743-10753","source":"Crossref","is-referenced-by-count":14,"title":["An Efficient Local Search for the Maximum Edge Weighted Clique Problem"],"prefix":"10.1109","volume":"6","author":[{"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2915-8242","authenticated-orcid":false,"given":"Xiaoli","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0228-y"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/728"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.056"},{"key":"ref32","first-page":"568","article-title":"Fast solving maximum weight clique problem in massive graphs","author":"cai","year":"2016","journal-title":"Proc IJCAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.003"},{"key":"ref30","first-page":"805","article-title":"Two efficient local search algorithms for maximum weight clique problem","author":"wang","year":"2016","journal-title":"Proc AAAI"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1613\/jair.5443","article-title":"Finding a small vertex cover in massive sparse graphs: Construct, local search, and preprocess","volume":"59","author":"cai","year":"2017","journal-title":"J Artif Intell Res"},{"key":"ref36","first-page":"747","article-title":"Balance between complexity and quality: Local search for minimum vertex cover in massive graphs","author":"cai","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref35","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc AAAI"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021525624027"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02243394"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/73"},{"key":"ref11","first-page":"424","article-title":"A new algorithm for the maximum-weight clique problem","volume":"8","author":"\u00f6sterg\u00e5rd","year":"2001","journal-title":"Nordic J Comput"},{"key":"ref12","first-page":"317","article-title":"A new exact algorithm for the maximum weight clique problem","author":"yamaguchi","year":"2008","journal-title":"Proc ITC-CSCC Int Tech Conf Circuits Syst Comput Commun"},{"key":"ref13","first-page":"303","article-title":"Solving maximum weight clique using maximum satisfiability reasoning","author":"fang","year":"2014","journal-title":"Proc 25st Eur Conf Artif Intell"},{"key":"ref14","first-page":"830","article-title":"An exact algorithm for the maximum weight clique problem in large graphs","author":"jiang","year":"2017","journal-title":"Proc AAAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90097-7"},{"key":"ref16","first-page":"109","article-title":"A cutting plane algorithm for optimal graph partitioning","volume":"57","author":"faigle","year":"1987","journal-title":"Methods Oper Res"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00299-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-014-0028-1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-006-3750-x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1124-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9026-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0215075"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_22"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50127-7_21"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010240415X"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1609\/aaai.v24i1.7536","article-title":"An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem","author":"li","year":"2010","journal-title":"Proc AAAI"},{"key":"ref7","first-page":"569","article-title":"An improved branch and bound algorithm for the maximum clique problem","volume":"58","author":"konc","year":"2007","journal-title":"Communications in Mathematical and in Computer Chemistry"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0003111"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.143"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_30"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","article-title":"Dynamic local search for the maximum clique problem","volume":"25","author":"pullan","year":"2006","journal-title":"J Artif Intell Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.915645"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-9635-y"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.053"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.06.002"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2015.4549"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9437-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.04.010"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/72.883403","article-title":"Approximating the maximum weight clique using replicator dynamics","volume":"11","author":"bomze","year":"2000","journal-title":"IEEE Trans Neural Netw"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08290962.pdf?arnumber=8290962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T05:22:16Z","timestamp":1719811336000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8290962\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2799953","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}