{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:09:24Z","timestamp":1778252964959,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540225706","type":"print"},{"value":"9783540278689","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27868-9_34","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T06:52:23Z","timestamp":1284619943000},"page":"325-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparison of Least Squares and Spectral Methods for Attributed Graph Matching"],"prefix":"10.1007","author":[{"given":"Jianfeng","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terry","family":"Caelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"34_CR1","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1016\/S0031-3203(03)00009-8","volume":"36","author":"B.J. van Wyk","year":"2003","unstructured":"van Wyk, B.J., Van Wyk, M.A.: Kronecker product graph matching. Pattern Recognition\u00a036(9), 2019\u20132030 (2003)","journal-title":"Pattern Recognition"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0031-3203(97)00041-1","volume":"31","author":"Y. El-Sonbaty","year":"1998","unstructured":"El-Sonbaty, Y., Ismail, M.A.: A new algorithm for subgraph optimal isomorphism. Pattern Recognition\u00a031(2), 205\u2013218 (1998)","journal-title":"Pattern Recognition"},{"issue":"4","key":"34_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE TPAMI\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE TPAMI"},{"issue":"5","key":"34_CR4","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An Eigen Decomposition Approach to Weighted Graph Matching Problems. IEEE TPAMI\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE TPAMI"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1098\/rspb.1991.0045","volume":"244","author":"G.L. Scott","year":"1991","unstructured":"Scott, G.L., Longuet-Higgins, H.C.: An algorithm for assoictaing the features for two patterns. Proc. Roy. Soc. Lond.\u00a0B244, 21\u201326 (1991)","journal-title":"Proc. Roy. Soc. Lond."},{"issue":"5","key":"34_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0262-8856(92)90043-3","volume":"10","author":"L. Shapiro","year":"1992","unstructured":"Shapiro, L., Brady, J.M.: Feature-based Correspondence:an eigenvector approach. Image & Vision Computing\u00a010(5), 283\u2013288 (1992)","journal-title":"Image & Vision Computing"},{"issue":"9","key":"34_CR7","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1016\/S0031-3203(03)00084-0","volume":"36","author":"B. Luo","year":"2003","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition\u00a036(9), 2213\u20132230 (2003)","journal-title":"Pattern Recognition"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-70659-3_13","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"S. Kosinov","year":"2002","unstructured":"Kosinov, S., Caelli, T.: Inexact Multisubgraph matching using Graph Eigenspace and Clustering Models. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 133\u2013142. Springer, Heidelberg (2002)"},{"key":"34_CR9","doi-asserted-by":"crossref","DOI":"10.1142\/1280","volume-title":"A First Look at Graph Theory","author":"J. Clark","year":"1991","unstructured":"Clark, J., Holton, D.A.: A First Look at Graph Theory. World Scientific Publishing, Singapore (1991)"},{"issue":"12","key":"34_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1002\/ecjc.4430731204","volume":"73","author":"S. Yamada","year":"1990","unstructured":"Yamada, S., Hasai, T.: An efficient algorithm for the linear assignment problem. Elect. Comm. Japan\u00a073(12), 28\u201336 Part 3 (1990)","journal-title":"Elect. Comm. Japan"},{"issue":"3","key":"34_CR11","first-page":"387","volume":"61","author":"L. Grewe","year":"1995","unstructured":"Grewe, L., Kak, A.C.: Interactive learning of a multiple-attribute hash table classifier for fast object recognition. CVIU\u00a061(3), 387\u2013416 (1995)","journal-title":"CVIU"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27868-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:15Z","timestamp":1778249415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-27868-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225706","9783540278689"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27868-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}