{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:23:54Z","timestamp":1729632234455,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icc.2019.8761634","type":"proceedings-article","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:16:31Z","timestamp":1563236191000},"page":"1-7","source":"Crossref","is-referenced-by-count":11,"title":["Digitally Annealed Solution for the Maximum Clique Problem with Critical Application in Cellular V2X"],"prefix":"10.1109","author":[{"given":"Zahra","family":"Naghsh","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Javad-Kalbasi","sequence":"additional","affiliation":[]},{"given":"Shahrokh","family":"Valaee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs, i","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Mathe-maticae (Debrecen)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61566-0_39"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08016-1_7"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","article-title":"A fast algorithm for the maximum clique problem","volume":"120","author":"ostergard","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_43"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_22"},{"article-title":"An improved branch and bound algorithm for the maximum clique problem","year":"2007","author":"konc","key":"ref14"},{"key":"ref15","doi-asserted-by":"crossref","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":"AAAI"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.143"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3075564.3075575"},{"key":"ref19","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 of Computing"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2017.8313219"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-015-0252-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.06.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2005219"},{"journal-title":"The Algorithm Design Manual","year":"1998","author":"skiena","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61566-0_39"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422704"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1815"},{"journal-title":"5G Americas V2X Cellular Solutions","article-title":"V2X cellular solutions","year":"2016","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3907"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2017.2752798"},{"article-title":"A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search","year":"2004","author":"kumlander","key":"ref20"},{"key":"ref22","first-page":"307","article-title":"Some improvements on kumlander’s maximum weight clique extraction algorithm","author":"shimizur","year":"2012","journal-title":"Proc of the International Conference on Electrical Computer Electronics and Communication Engineering"},{"key":"ref21","first-page":"165","article-title":"On importance of a special sorting in the maximum-weight clique algorithm based on colour classes","author":"\u00f6sterg\u00e5rd","year":"2008","journal-title":"Modelling Computation and Optimization in Information Systems and Management Sciences"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4953"},{"key":"ref23","article-title":"Optimal table method for finding the maximum weight clique","author":"shimizur","year":"2013","journal-title":"WSEAS International Conference Proceedings Recent Advances in Computer Engineering Series"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1124-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9026-2"}],"event":{"name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","start":{"date-parts":[[2019,5,20]]},"location":"Shanghai, China","end":{"date-parts":[[2019,5,24]]}},"container-title":["ICC 2019 - 2019 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8753818\/8761046\/08761634.pdf?arnumber=8761634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T08:28:05Z","timestamp":1695025685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8761634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icc.2019.8761634","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}