{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:05:49Z","timestamp":1743008749279,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_5","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:32:14Z","timestamp":1228116734000},"page":"5-14","source":"Crossref","is-referenced-by-count":5,"title":["Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks"],"prefix":"10.1007","author":[{"given":"David","family":"Emms","sequence":"first","affiliation":[]},{"given":"Richard C.","family":"Wilson","sequence":"additional","affiliation":[]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1145\/800070.802206","volume-title":"STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing","author":"L. Babai","year":"1982","unstructured":"Babai, L., Grigoryev, D.Y., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 310\u2013324. ACM Press, New York (1982)"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H.G. Barrow","year":"1976","unstructured":"Barrow, H.G., Burstall, R.M.: Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters\u00a04(4), 83\u201384 (1976)","journal-title":"Information Processing Letters"},{"key":"5_CR3","first-page":"48","volume-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computation (STOC)","author":"R. Beals","year":"1997","unstructured":"Beals, R.: Quantum computation of Fourier transforms over symmetric groups. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computation (STOC), Texas, pp. 48\u201353. ACM Press, New York (1997)"},{"key":"5_CR4","first-page":"59","volume-title":"STOC 2003: Proc. 35th ACM symposium on TOC","author":"A.M. Childs","year":"2003","unstructured":"Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: STOC 2003: Proc. 35th ACM symposium on TOC, pp. 59\u201368. ACM Press, New York (2003)"},{"key":"5_CR5","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-540-74272-2_102","volume-title":"Computer Analysis of Images and Patterns","author":"D. Emms","year":"2007","unstructured":"Emms, D., Hancock, E.R., Wilson, R.C.: Graph similarity using interfering quantum walks. In: Kropatsch, W.G., Kampel, M., Hanbury, A. (eds.) CAIP 2007. LNCS, vol.\u00a04673, pp. 823\u2013831. Springer, Heidelberg (2007)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-72903-7_34","volume-title":"Graph-Based Representations in Pattern Recognition","author":"D. Emms","year":"2007","unstructured":"Emms, D., Wilson, R.C., Hancock, E.R.: Graph Embedding Using Quantum Commute Times. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol.\u00a04538, pp. 371\u2013382. Springer, Heidelberg (2007)"},{"key":"5_CR8","unstructured":"Ettinger, M., H\u00f8yer, P.: A quantum observable for the graph isomorphism problem (1999)"},{"key":"5_CR9","unstructured":"Ettinger, M., H\u00f8yer, P.: The hidden subgroup problem and permutation group theory (2004)"},{"key":"5_CR10","first-page":"212","volume-title":"Proc. 28th Annual ACM Symposium on the Theory of Computation","author":"L. Grover","year":"1996","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. 28th Annual ACM Symposium on the Theory of Computation, pp. 212\u2013219. ACM Press, New York (1996)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: A linear time algorithm for isomorphism of planar graphs. In: Proceedings of the 6th Annual ACM Symposium on the Theory of Computing (STOC 1974), pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/5992.909000","volume":"03","author":"R. Jozsa","year":"2001","unstructured":"Jozsa, R.: Quantum factoring, discrete logarithms, and the hidden subgroup problem. Computing in Science and Engineering\u00a003(2), 34\u201343 (2001)","journal-title":"Computing in Science and Engineering"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1080\/00107151031000110776","volume":"44","author":"J. Kempe","year":"2003","unstructured":"Kempe, J.: Quantum random walks\u2014an introductory overview. Contemporary Physics\u00a044(4), 307\u2013327 (2003)","journal-title":"Contemporary Physics"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11780342_26","volume-title":"Logical Approaches to Computational Barriers","author":"J. K\u00f6bler","year":"2006","unstructured":"K\u00f6bler, J.: On graph isomorphism for restricted graph classes. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 241\u2013256. Springer, Heidelberg (2006)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Miyazaki, T.: The complexity of Mckay\u2019s canonical labeling algorithm (1996)","DOI":"10.1090\/dimacs\/028\/14"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023(1), 31\u201342 (1976)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:46:25Z","timestamp":1558266385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}