{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T15:06:53Z","timestamp":1760800013484,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T00:00:00Z","timestamp":1491782400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","award":["IT03226"],"award-info":[{"award-number":["IT03226"]}],"id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11128-017-1569-z","type":"journal-article","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T06:58:14Z","timestamp":1491807494000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Systematic and deterministic graph minor embedding for Cartesian products of graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"Arman","family":"Zaribafiyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominic J. J.","family":"Marchand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Saeed","family":"Changiz Rezaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,10]]},"reference":[{"key":"1569_CR1","doi-asserted-by":"publisher","unstructured":"Adler, I., Dorn, F., Fomin, F.V., Sau, I., Thilikos, D.M.: Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50), 7018\u20137028 (2011). doi: 10.1016\/j.tcs.2011.09.015 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397511007912","DOI":"10.1016\/j.tcs.2011.09.015"},{"key":"1569_CR2","unstructured":"Alghassi, H.: The algebraic QUBO design framework. To be published"},{"issue":"3","key":"1569_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.: Treewidth computations i. upper bounds. Inf. Comput. 208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"issue":"1","key":"1569_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s11128-015-1150-6","volume":"15","author":"T Boothby","year":"2016","unstructured":"Boothby, T., King, A.D., Roy, A.: Fast clique minor generation in chimera qubit connectivity graphs. Quantum Inf. Process. 15(1), 495\u2013508 (2016). doi: 10.1007\/s11128-015-1150-6","journal-title":"Quantum Inf. Process."},{"key":"1569_CR5","unstructured":"Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. Preprint (2014). arXiv:1406.2741"},{"issue":"3","key":"1569_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11128-010-0200-3","volume":"10","author":"V Choi","year":"2011","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: $${\\rm II}$$ II . $${\\rm M}$$ M inor-universal graph design. Quantum Inf. Process. 10(3), 343\u2013353 (2011). doi: 10.1007\/s11128-010-0200-3","journal-title":"Quantum Inf. Process."},{"key":"1569_CR7","unstructured":"Dridi, R., Alghassi, H.: Homology computation of large point clouds using quantum annealing. Preprint (2015). arXiv:1512.09328"},{"issue":"1","key":"1569_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10898-009-9520-1","volume":"48","author":"N Fan","year":"2010","unstructured":"Fan, N., Pardalos, P.M.: Linear and quadratic programming approaches for the general graph partitioning problem. J. Glob. Optim. 48(1), 57\u201371 (2010). doi: 10.1007\/s10898-009-9520-1","journal-title":"J. Glob. Optim."},{"key":"1569_CR9","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory, Volume 207 of Graduate Texts in Mathematics (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"issue":"1","key":"1569_CR10","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jctb.2008.06.004","volume":"99","author":"M Grohe","year":"2009","unstructured":"Grohe, M., Marx, D.: On tree width, bramble size, and expansion. J. Comb. Theory Ser. B 99(1), 218\u2013228 (2009)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"1569_CR11","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/S0895480199335829","volume":"12","author":"WW Hager","year":"1999","unstructured":"Hager, W.W., Krylyuk, Y.: Graph partitioning and continuous quadratic programming. SIAM J. Discret. Math. 12(4), 500\u2013523 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"1569_CR12","unstructured":"Hernandez, M., Zaribafiyan, A., Aramon, M., Naghibi, M.: A novel graph-based approach for determining molecular similarity. Preprint (2016). arXiv:1601.06693"},{"issue":"3\u20135","key":"1569_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.disc.2005.09.038","volume":"307","author":"W Imrich","year":"2007","unstructured":"Imrich, W., Peterin, I.: Recognizing $${\\rm C}$$ C artesian products in linear time. Discret. Math. 307(3\u20135), 472\u2013483 (2007)","journal-title":"Discret. Math."},{"issue":"7346","key":"1569_CR14","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., Amin, M.H.S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A.J., Johansson, J., Bunyk, P., Chapple, E.M., Enderud, C., Hilton, J.P., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M.C., Tolkacheva, E., Truncik, C.J.S., Uchaikin, S., Wang, J., Wilson, B., Rose, G.: Quantum annealing with manufactured spins. Nature 473(7346), 194\u2013198 (2011)","journal-title":"Nature"},{"key":"1569_CR15","doi-asserted-by":"publisher","unstructured":"Kaminsky, W., Lloyd, S.: Scalable architecture for adiabatic quantum computing of $$\\rm NP$$ NP -hard problems. In: Leggett, A., Ruggiero, B., Silvestrini, P. (eds.) Quantum Computing and Quantum Bits in Mesoscopic Systems, pp. 229\u2013236. Springer, New York (2004). doi: 10.1007\/978-1-4419-9092-1_25","DOI":"10.1007\/978-1-4419-9092-1_25"},{"issue":"2","key":"1569_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1215\/S0012-7094-46-01324-5","volume":"13","author":"I Kaplansky","year":"1946","unstructured":"Kaplansky, I., Riordan, J.: The problem of the rooks and its applications. Duke Math. J. 13(2), 259\u2013268 (1946). doi: 10.1215\/S0012-7094-46-01324-5","journal-title":"Duke Math. J."},{"key":"1569_CR17","unstructured":"King, A.D., Lanting, T., Harris, R.: Performance of a quantum annealer on range-limited constraint satisfaction problems. Preprint (2015). arXiv:1502.02098"},{"issue":"8","key":"1569_CR18","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.dam.2006.11.006","volume":"155","author":"B Lucena","year":"2007","unstructured":"Lucena, B.: Achievable sets, brambles, and sparse treewidth obstructions. Discret. Appl. Math. 155(8), 1055\u20131065 (2007)","journal-title":"Discret. Appl. Math."},{"key":"1569_CR19","doi-asserted-by":"publisher","unstructured":"Pardalos, P.M., Mavridou, T., Xue, J.: Handbook of Combinatorial Optimization: volume 2, chap. The Graph Coloring Problem: A Bibliographic Survey, pp. 1077\u20131141. Springer, Boston (1999). doi: 10.1007\/978-1-4613-0303-9_16","DOI":"10.1007\/978-1-4613-0303-9_16"},{"key":"1569_CR20","unstructured":"Perdomo-Ortiz, A., Fluegemann, J., Biswas, R., Smelyanskiy, V.N.: A performance estimator for quantum annealers: gauge selection and parameter setting. Preprint (2015). arXiv:1503.01083"},{"key":"1569_CR21","doi-asserted-by":"publisher","unstructured":"Perdomo-Ortiz, A., O\u2019Gorman, B., Fluegemann, J., Biswas, R., Smelyanskiy, V.N.: Determination and correction of persistent biases in quantum annealers. Sci. Rep. 6, 18628 (2016)","DOI":"10.1038\/srep18628"},{"issue":"1","key":"1569_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-014-0892-x","volume":"14","author":"EG Rieffel","year":"2014","unstructured":"Rieffel, E.G., Venturelli, D., O\u2019Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy, V.N.: A case study in programming a quantum annealer for hard operational planning problems. Quantum Inf. Process. 14(1), 1\u201336 (2014). doi: 10.1007\/s11128-014-0892-x","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"1569_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-014-0892-x","volume":"14","author":"EG Rieffel","year":"2015","unstructured":"Rieffel, E.G., Venturelli, D., O\u2019Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy, V.N.: A case study in programming a quantum annealer for hard operational planning problems. Quantum Inf. Process. 14(1), 1\u201336 (2015)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"1569_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min\u2013max theorem for tree-width. J. Comb. Theory Ser. B 58(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1569_CR25","unstructured":"Thomas, R.: Tree-decompositions of graphs (lecture notes). School of Mathematics. Georgia Institute of Technology, Atlanta, 30332 (1996)"},{"key":"1569_CR26","doi-asserted-by":"publisher","first-page":"031040","DOI":"10.1103\/PhysRevX.5.031040","volume":"5","author":"D Venturelli","year":"2015","unstructured":"Venturelli, D., Mandr\u00e0, S., Knysh, S., O\u2019Gorman, B., Biswas, R., Smelyanskiy, V.: Quantum optimization of fully connected spin glasses. Phys. Rev. X 5, 031040 (2015). doi: 10.1103\/PhysRevX.5.031040","journal-title":"Phys. Rev. X"},{"key":"1569_CR27","unstructured":"Venturelli, D., Marchand, D.J.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling. Preprint (2015). arXiv:1506.08479"},{"key":"1569_CR28","doi-asserted-by":"publisher","first-page":"062314","DOI":"10.1103\/PhysRevA.88.062314","volume":"88","author":"KC Young","year":"2013","unstructured":"Young, K.C., Blume-Kohout, R., Lidar, D.A.: Adiabatic quantum optimization with the wrong Hamiltonian. Phys. Rev. A 88, 062314 (2013). doi: 10.1103\/PhysRevA.88.062314","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-017-1569-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-017-1569-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-017-1569-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T17:22:43Z","timestamp":1569000163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-017-1569-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,10]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1569"],"URL":"https:\/\/doi.org\/10.1007\/s11128-017-1569-z","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2017,4,10]]},"article-number":"136"}}