{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T11:34:35Z","timestamp":1771673675139,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T00:00:00Z","timestamp":1494806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,15]]},"DOI":"10.1145\/3075564.3075575","type":"proceedings-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T12:47:29Z","timestamp":1496839649000},"page":"63-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Finding Maximum Cliques on a Quantum Annealer"],"prefix":"10.1145","author":[{"given":"Guillaume","family":"Chapuis","sequence":"first","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM"}]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM"}]},{"given":"Georg","family":"Hahn","sequence":"additional","affiliation":[{"name":"Imperial College London, South Kensington Campus, London, U.K."}]},{"given":"Guillaume","family":"Rizk","sequence":"additional","affiliation":[{"name":"INRJA\/Irisa, Campus de Beaulieu, Rennes Cedex, France"}]}],"member":"320","published-online":{"date-parts":[[2017,5,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215075"},{"key":"e_1_3_2_1_2_1","unstructured":"V. Batagelj and M. Zaversnik. 2011. An O(m) Algorithm for Cores Decomposition of Networks. Adv Dat An Class 5 2 (2011).  V. Batagelj and M. Zaversnik. 2011. An O(m) Algorithm for Cores Decomposition of Networks. Adv Dat An Class 5 2 (2011)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASC.2014.2318294"},{"key":"e_1_3_2_1_4_1","unstructured":"D-Wave. 2016. D-Wave post-processing guide. (2016).  D-Wave. 2016. D-Wave post-processing guide. (2016)."},{"key":"e_1_3_2_1_5_1","unstructured":"D-Wave. 2016. Introduction to the D-Wave Quantum Hardware. (2016).  D-Wave. 2016. Introduction to the D-Wave Quantum Hardware. (2016)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.031015"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2172\/1330079"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.06.009"},{"key":"e_1_3_2_1_9_1","unstructured":"Gurobi Optimization Inc. 2015. Gurobi Optimizer Reference Manual. (2015). http:\/\/www.gurobi.com  Gurobi Optimization Inc. 2015. Gurobi Optimizer Reference Manual. (2015). http:\/\/www.gurobi.com"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature10012"},{"key":"e_1_3_2_1_11_1","volume-title":"Benchmarking a quantum annealing processor with the time-to-target metric. arXiv: 1508.05087","author":"King J.","year":"2015","unstructured":"J. King , S. Yarkoni , M.M. Nevisi , J.P. Hilton , and C.C. McGeoch . 2015. Benchmarking a quantum annealing processor with the time-to-target metric. arXiv: 1508.05087 ( 2015 ), 1--29. J. King, S. Yarkoni, M.M. Nevisi, J.P. Hilton, and C.C. McGeoch. 2015. Benchmarking a quantum annealing processor with the time-to-target metric. arXiv: 1508.05087 (2015), 1--29."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_2_1_13_1","volume-title":"International Workshop on Algorithms and Models for the Web-Graph. Springer, 156--169","author":"Pattabiraman B.","unstructured":"B. Pattabiraman , M. Patwary , A. Gebremedhin , WK. Liao , and A. Choudhary . 2013. Fast algorithms for the maximum clique problem on massive sparse graphs . In International Workshop on Algorithms and Models for the Web-Graph. Springer, 156--169 . B. Pattabiraman, M. Patwary, A. Gebremedhin, WK. Liao, and A. Choudhary. 2013. Fast algorithms for the maximum clique problem on massive sparse graphs. In International Workshop on Algorithms and Models for the Web-Graph. Springer, 156--169."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1252319"},{"key":"e_1_3_2_1_15_1","unstructured":"R. Rossi D. Gleich A. Gebremedhin and M. Patwary. 2013. A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. CoRR abs\/1302.6256 (2013).  R. Rossi D. Gleich A. Gebremedhin and M. Patwary. 2013. A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. CoRR abs\/1302.6256 (2013)."}],"event":{"name":"CF '17: Computing Frontiers Conference","location":"Siena Italy","acronym":"CF '17","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the Computing Frontiers Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3075564.3075575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3075564.3075575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:42Z","timestamp":1750215822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3075564.3075575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,15]]},"references-count":15,"alternative-id":["10.1145\/3075564.3075575","10.1145\/3075564"],"URL":"https:\/\/doi.org\/10.1145\/3075564.3075575","relation":{},"subject":[],"published":{"date-parts":[[2017,5,15]]},"assertion":[{"value":"2017-05-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}