{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:16:06Z","timestamp":1778300166281,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404989","type":"print"},{"value":"9783540450634","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45063-4_33","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T21:56:31Z","timestamp":1294523791000},"page":"517-532","source":"Crossref","is-referenced-by-count":6,"title":["Graph Matching Using Spectral Seriation"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Robles-Kelly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Siddiqi, K., Shokoufandeh, A., Dickinson, S.J., Zucker, S.W.: Indexing using a spectral encoding of topological structure. In: Proceedings of the Computer Vision and Pattern Recognition (1998)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bin, L., Hancock, E.R.: Procrustes alignment with the em algorithm. In: 8th International Conference on Computer Analysis of Images and Image Patterns, pp. 623\u2013631 (1999)","DOI":"10.1007\/3-540-48375-6_74"},{"key":"33_CR3","unstructured":"Wilson Bin Luo, R.C., Hancock, E.R.: Spectral feature vectors for graph clustering. In: S+SSPR 2002 (2002)"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0219467802000603","volume":"2","author":"R. Wilson","year":"2002","unstructured":"Wilson, R., Luo, B., Hancock, E.: Eigenspaces for graphs. International Journal of Image and Graphics\u00a02(2), 247\u2013268 (2002)","journal-title":"International Journal of Image and Graphics"},{"issue":"8","key":"33_CR5","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters\u00a018(8), 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"key":"33_CR6","volume-title":"Spectral Graph Theory","author":"F.R.K. Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TSMC.1984.6313232","volume":"14","author":"M.A. Eshera","year":"1984","unstructured":"Eshera, M.A., Fu, K.S.: A graph distance measure for image analysis. IEEE Transactions on Systems, Man and Cybernetics\u00a014, 398\u2013407 (1984)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"12","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1016\/0031-3203(95)00048-8","volume":"28","author":"R. Horaud","year":"1995","unstructured":"Horaud, R., Sossa, H.: Polyhedral object recognition by indexing. Pattern Recognition\u00a028(12), 1855\u20131870 (1995)","journal-title":"Pattern Recognition"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"E.G. Roman","year":"1998","unstructured":"Roman, E.G., Atkins, J.E., Hendrickson, B.: A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing\u00a028(1), 297\u2013310 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"33_CR10","first-page":"1","volume":"2","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. Bolyai Society Mathematical Studies\u00a02(2), 1\u201346 (1993)","journal-title":"Bolyai Society Mathematical Studies"},{"key":"33_CR11","first-page":"707","volume":"6","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl.\u00a06, 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"33_CR12","unstructured":"Luo, B., Hancock, E.R.: Structural graph matching using the EM algorithm and singular value decomposition. To appear in IEEE Trans. on Pattern Analysis and Machine Intelligence (2001)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Some applications of laplace eigenvalues of graphs. In: Hahn, G., Sabidussi, G. (eds.) ASIAN 1997. NATO ASI Series C, pp. 227\u2013275 (1997)","DOI":"10.1007\/978-94-015-8937-6_6"},{"issue":"6","key":"33_CR14","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R. Myers","year":"2000","unstructured":"Myers, R., Wilson, R.C., Hancock, E.R.: Bayesian graph edit distance. PAMI\u00a022(6), 628\u2013635 (2000)","journal-title":"PAMI"},{"issue":"6","key":"33_CR15","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/34.506420","volume":"18","author":"B.J. Oommen","year":"1996","unstructured":"Oommen, B.J., Zhang, K.: The normalized string editing problem revisited. PAMI\u00a018(6), 669\u2013672 (1996)","journal-title":"PAMI"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Robles-Kelly, A., Hancock, E.R.: A maximum likelihood framework for iterative eigendecomposition. In: Proc. of the IEEE International Conference on Conputer Vision, pp. 654\u2013661 (2001)","DOI":"10.1109\/ICCV.2001.937582"},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics\u00a013, 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Scott, G., Longuet-Higgins, H.: An algorithm for associating the features of two images. In: Proceedings of the Royal Society of London, B 244 (1991)","DOI":"10.1098\/rspb.1991.0045"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TPAMI.1982.4767312","volume":"4","author":"L.G. Shapiro","year":"1982","unstructured":"Shapiro, L.G., Haralick, R.M.: Relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a04, 595\u2013602 (1982)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Shapiro, L.S., Brady, J.M.: A modal approach to feature-based correspondence. In: British Machine Vision Conference (1991)","DOI":"10.5244\/C.5.11"},{"issue":"5","key":"33_CR21","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. PAMI\u00a010(5), 695\u2013703 (1988)","journal-title":"PAMI"},{"key":"33_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05156-2","volume-title":"Matrix Iterative Analysis","author":"R.S. Varga","year":"2000","unstructured":"Varga, R.S.: Matrix Iterative Analysis, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Wagner, R.A., Fisher, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021(1) (1974)","DOI":"10.1145\/321796.321811"},{"issue":"8","key":"33_CR24","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/34.709622","volume":"20","author":"J.T.L. Wang","year":"1998","unstructured":"Wang, J.T.L., Shapiro, B.A., Shasha, D., Zhang, K., Curre, K.M.: An algorithm for finding the largest approximately common substructures of two trees. PAMI\u00a020(8), 889\u2013895 (1998)","journal-title":"PAMI"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45063-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:15:37Z","timestamp":1740842137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45063-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404989","9783540450634"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45063-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}