{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:06:43Z","timestamp":1742915203514,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219811"},{"type":"electronic","value":"9783540246732"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-24673-2_10","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T18:59:46Z","timestamp":1294858786000},"page":"114-126","source":"Crossref","is-referenced-by-count":11,"title":["Spectral Simplification of Graphs"],"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","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Atkins, J.E., Boman, E.G., Hendrickson, B.: A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing (1998)","DOI":"10.1137\/S0097539795285771"},{"key":"10_CR2","series-title":"CBMS series","volume-title":"Spectral Graph Theory","author":"F.R.K. Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. CBMS series, vol.\u00a092. American Mathmatical Society Ed., Providence (1997)"},{"key":"10_CR3","unstructured":"Diaz, J., Petit, J., Serna, M.: A survey on graph layout problems. Technical report LSI-00-61-R, Universitat Polit\u2018ecnica de Catalunya (2000)"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/BF01591018","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"Fiedler, M.: A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathematics Journal\u00a025, 619\u2013633 (1975)","journal-title":"Czechoslovak Mathematics Journal"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Haemers, W.H.: Interlacing eigenvalues and graphs. Linear Algebra and its Applications, 593\u2013616 (1995)","DOI":"10.1016\/0024-3795(95)00199-2"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pp. 291\u2013307 (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"issue":"8","key":"10_CR7","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions insertions and reversals. Soviet Physics-Doklandy\u00a010(8), 707\u2013710 (1966)","journal-title":"Soviet Physics-Doklandy"},{"issue":"10","key":"10_CR8","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI\u00a023(10), 1120\u20131136 (2001)","journal-title":"IEEE PAMI"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B.T. Messmer","year":"1998","unstructured":"Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE PAMI\u00a020, 493\u2013504 (1998)","journal-title":"IEEE PAMI"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/21.362950","volume":"25","author":"A. Marzal","year":"1995","unstructured":"Marzal, A., Vidal, E.: Computation of normalized edit distance and applications. IEEE Trans. Systems, Man, and Cybernetics\u00a025, 202\u2013206 (1995)","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Some applications of laplace eigenvalues of graphs. In: Graph Symmetry: Algebraic Methods and Applications. NATO ASI Series C, vol.\u00a0497, pp. 227\u2013275 (1997)","DOI":"10.1007\/978-94-015-8937-6_6"},{"issue":"6","key":"10_CR12","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. IEEE PAMI\u00a022(6), 628\u2013635 (2000)","journal-title":"IEEE PAMI"},{"issue":"2","key":"10_CR13","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.: Feature-based correspondence: an eigenvector approach. Image and Vision Computing\u00a010(2), 283\u2013288 (1992)","journal-title":"Image and Vision Computing"},{"issue":"8","key":"10_CR14","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE PAMI\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE PAMI"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Shokoufandeh, A., Dickinson, S.J., Siddiqi, K., Zucker, S.W.: Indexing using a spectral encoding of topological structure. In: IEEE-ICPR, pp. 491\u2013497 (1999)","DOI":"10.1109\/CVPR.1999.784726"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE PAMI\u00a010, 695\u2013703 (1988)","journal-title":"IEEE PAMI"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.: The string-to-string correction problem. J. ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"6","key":"10_CR18","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"R.C. Wilson","year":"1997","unstructured":"Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. IEEE PAMI\u00a019(6), 634\u2013648 (1997)","journal-title":"IEEE PAMI"},{"key":"10_CR19","series-title":"Wiley international edition","volume-title":"Graphs: an introductory approach: a first course in discrete mathematics","author":"R.J. Wilson","year":"1990","unstructured":"Wilson, R.J., Watkins, J.J.: Graphs: an introductory approach: a first course in discrete mathematics. Wiley international edition. Wiley, New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision - ECCV 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24673-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T17:17:28Z","timestamp":1740849448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24673-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219811","9783540246732"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24673-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}