{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:39:22Z","timestamp":1773841162701,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642219993","type":"print"},{"value":"9783642220005","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22000-5_57","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T05:21:59Z","timestamp":1309152119000},"page":"553-562","source":"Crossref","is-referenced-by-count":19,"title":["Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm"],"prefix":"10.1007","author":[{"given":"Olawale","family":"Titiloye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Crispin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T. Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Physical Review E\u00a058, 5355 (1998)","journal-title":"Physical Review E"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1103\/RevModPhys.80.1061","volume":"80","author":"A. Das","year":"2008","unstructured":"Das, A., Chakrabarti, B.K.: Quantum Annealing and quantum analog computation. Rev. Mod. Phys.\u00a080, 1061 (2008)","journal-title":"Rev. Mod. Phys."},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"57701","DOI":"10.1103\/PhysRevE.70.057701","volume":"70","author":"R. Marto\u0148\u00e1k","year":"2004","unstructured":"Marto\u0148\u00e1k, R., Santoro, G.E., Tosatti, E.: Quantum annealing of the traveling salesman problem. Phys. Rev. E\u00a070, 057701 (2004)","journal-title":"Phys. Rev. E"},{"key":"57_CR5","first-page":"66707","volume":"71","author":"D.A. Battaglia","year":"2005","unstructured":"Battaglia, D.A., Santoro, G.E., Tosatti, E.: Optimization by quantum annealing: Lessons from hard satisfiability problems. Phys. Rev.\u00a071, 066707 (2005)","journal-title":"Phys. Rev."},{"issue":"4","key":"57_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"57_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Monaaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing\u00a020(2), 302\u2013316 (2008)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"57_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: A memetic algorithm for graph coloring. European Journal of Operational Research\u00a0203(1), 241\u2013250 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"57_CR9","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1016\/j.cor.2010.01.015","volume":"37","author":"D.C. Porumbel","year":"2010","unstructured":"Porumbel, D.C., Hao, J.K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph colouring. Computers and Operations Research\u00a037(1), 1822\u20131832 (2010)","journal-title":"Computers and Operations Research"},{"key":"57_CR10","doi-asserted-by":"publisher","first-page":"12521","DOI":"10.1063\/1.2995837","volume":"49","author":"S. Morita","year":"2008","unstructured":"Morita, S., Nishimori, H.: Mathematical foundations of quantum annealing. Journal of Mathematical Physics\u00a049, 12521 (2008)","journal-title":"Journal of Mathematical Physics"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Titiloye, O., Crispin, A.: Quantum annealing of the graph coloring problem. Discrete Optimization (2011), doi:10.1016\/j.disopt.2010.12.001","DOI":"10.1016\/j.disopt.2010.12.001"},{"key":"57_CR12","series-title":"DIMACS series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"D.S. Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. American Mathematical Society, Providence (1996)"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Morgenstern, C.: Distributed coloration neighborhood search. In: [12], pp. 335\u2013358","DOI":"10.1090\/dimacs\/026\/16"},{"key":"57_CR14","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1137\/S1052623497329683","volume":"9","author":"H. Cohn","year":"1999","unstructured":"Cohn, H., Fielding, M.: Simulated annealing: searching for an optimal temperature schedule. SIAM Journal on Optimization\u00a09, 779\u2013802 (1999)","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"57_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TCAD.1986.1270190","volume":"5","author":"J.A. Greene","year":"1986","unstructured":"Greene, J.A., Supowit, K.J.: Simulated annealing without rejected moves. IEEE Trans.Comput.-Aided Design CAD\u00a05(1), 221\u2013228 (1986)","journal-title":"IEEE Trans.Comput.-Aided Design CAD"},{"issue":"3","key":"57_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0020-0190(01)00263-0","volume":"82","author":"D. Gusfield","year":"2002","unstructured":"Gusfield, D.: Partition-distance: a problem and class of perfect graphs arising in clustering. Information Processing Letters\u00a082(3), 159\u2013164 (2002)","journal-title":"Information Processing Letters"},{"issue":"2","key":"57_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P. Galinier","year":"2008","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the k-coloring problem. Discrete Applied Mathematics\u00a0156(2), 267\u2013279 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"57_CR18","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers and Operations Research\u00a035(3), 960\u2013975 (2008)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Agent and Multi-Agent Systems: Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22000-5_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T12:45:14Z","timestamp":1553863514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22000-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219993","9783642220005"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22000-5_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}