{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:18:38Z","timestamp":1725495518299},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404521"},{"type":"electronic","value":"9783540450283"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45028-9_16","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T22:49:43Z","timestamp":1194994183000},"page":"178-189","source":"Crossref","is-referenced-by-count":3,"title":["Graph Partition for Matching"],"prefix":"10.1007","author":[{"given":"Huaijun","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"16_CR1","first-page":"256","volume":"1451","author":"L. Brun","year":"2000","unstructured":"Luc Brun and Walter G. Kropatsch. Irregular pyramids with combinatorial maps. SSPR\/SPR, 1451:256\u2013265, 2000.","journal-title":"SSPR\/SPR"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"F.R.K. Chung. Spectral Graph Theory. CBMS series 92. American Mathmatical Society Ed., 1997.","DOI":"10.1090\/cbms\/092"},{"key":"16_CR3","unstructured":"J. Diaz, J. Petit, and M. Serna. A survey on graph layout problems. Technical report LSI-00-61-R, Universitat Polit\u00e8cnica de Catalunya, Departament de Llenguatges i Sistemes Inform\u00e0tics, 2000."},{"issue":"7","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1162\/089976698300017188","volume":"10","author":"A.M. Finch","year":"1998","unstructured":"A.M. Finch, R.C. Wilson, and E.R. Hancock. An energy function and continuous edit process for graph matching. Neural Computation, 10(7):1873\u20131894, 1998.","journal-title":"Neural Computation"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE PAMI, 18(4):377\u2013388, 1996.","journal-title":"IEEE PAMI"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","volume":"226\u2013228","author":"W.H. Haemers","year":"1995","unstructured":"W.H. Haemers. Interlacing eigenvalues and graphs. Linear Algebra and its Applications, (226\u2013228):593\u2013616, 1995.","journal-title":"Linear Algebra and its Applications"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291\u2013307, 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"B. Luo, A. D. Cross, and E. R. Hancock. Corner detection via topographic analysis of vector potential. Proceedings of the 9 th British Machine Vision Conference, 1998.","DOI":"10.5244\/C.12.57"},{"key":"16_CR9","unstructured":"B. Luo, R.C. Wilson, and E.R. Hancock. Spectral embedding of graphs. 2002 Winter Workshop on Computer Vision."},{"issue":"10","key":"16_CR10","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Bin Luo and Edwin R. Hancock. Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI, 23(10):1120\u20131136, 2001.","journal-title":"IEEE PAMI"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B.T. Messmer","year":"1998","unstructured":"B.T. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE PAMI, 20:493\u2013504, 1998.","journal-title":"IEEE PAMI"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"B. Mohar. Some applications of laplace eigenvalues of graphs. Graph Symmetry: Algebraic Methods and Applications, 497 NATO ASI Series C:227\u2013275, 1997.","DOI":"10.1007\/978-94-015-8937-6_6"},{"issue":"6","key":"16_CR13","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R. Myers","year":"2000","unstructured":"Richard Myers, Richard C. Wilson, and Edwin R. Hancock. Bayesian graph edit distance. IEEE PAMI, 22(6):628\u2013635, 2000.","journal-title":"IEEE PAMI"},{"issue":"8","key":"16_CR14","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. IEEE PAMI, 22(8):888\u2013905, 2000.","journal-title":"IEEE PAMI"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, and S.W. Zucker. Indexing using a spectral encoding of topological structure. In Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pages 491\u2013497, 1999.","DOI":"10.1109\/CVPR.1999.784726"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE PAMI, 10:695\u2013703, 1988.","journal-title":"IEEE PAMI"},{"issue":"6","key":"16_CR17","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"R. C. Wilson","year":"1997","unstructured":"Richard C. Wilson and Edwin R. Hancock. Structural matching by discrete relaxation. IEEE PAMI, 19(6):634\u2013648, 1997.","journal-title":"IEEE PAMI"},{"key":"16_CR18","volume-title":"Graphs: an introductory approach: a first course in discrete mathematics","author":"R.J. Wilson","year":"1990","unstructured":"R.J. Wilson and John J. Watkins. Graphs: an introductory approach: a first course in discrete mathematics. Wiley international edition. New York, etc., Wiley, 1990.","edition":"Wiley internati"}],"container-title":["Lecture Notes in Computer Science","Graph Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45028-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:21:34Z","timestamp":1556968894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45028-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404521","9783540450283"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45028-9_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}