{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T21:00:43Z","timestamp":1761512443969,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729020"},{"type":"electronic","value":"9783540729037"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72903-7_11","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T02:54:03Z","timestamp":1187578443000},"page":"114-125","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Sets of 3D Digital Shapes Through Topological Structures"],"prefix":"10.1007","author":[{"given":"Laura","family":"Paraboschi","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Biasotti","sequence":"additional","affiliation":[]},{"given":"Bianca","family":"Falcidieno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Size functions for 3D shape retrieval. In: Eurographics Symposium on Geometry Processing, pp. 239\u2013242 (2006)","key":"11_CR1"},{"doi-asserted-by":"crossref","unstructured":"Falcidieno, B., Spagnuolo, M.: A shape abstraction paradigm for modeling geometry and semantics. In: Computer Graphics International, pp. 646\u2013657 (1998)","key":"11_CR2","DOI":"10.1109\/CGI.1998.694323"},{"issue":"7","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/TPAMI.2005.146","volume":"27","author":"A. Torsello","year":"2005","unstructured":"Torsello, A., Hidovic-Rowe, D., Pelillo, M.: Polynomial-time metrics for attributed trees. IEEE Trans. on Pattern Anlysis and Machine Intelligence\u00a027(7), 1087\u20131099 (2005)","journal-title":"IEEE Trans. on Pattern Anlysis and Machine Intelligence"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters\u00a019, 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"M.L. Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M.L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters\u00a022, 753\u2013758 (2001)","journal-title":"Pattern Recognition Letters"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-540-31988-7_25","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Marini","year":"2005","unstructured":"Marini, S., Spagnuolo, M., Falcidieno, B.: From exact to approximate maximum common subgraph. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol.\u00a03434, pp. 263\u2013272. Springer, Heidelberg (2005)"},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TPAMI.2005.142","volume":"27","author":"A. Shokoufandeh","year":"2005","unstructured":"Shokoufandeh, A., Macrini, D., Dickinson, S., Siddiqi, K., Zucker, S.W.: Indexing hierarchical structures using graph spectra. IEEE Trans. on Pattern Anlysis and Machine Intelligence\u00a027(7), 1125\u20131140 (2005)","journal-title":"IEEE Trans. on Pattern Anlysis and Machine Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Robles-Kelly, A., Hancock, E.R.: Graph matching using adjacency matrix Markov chains. In: The British Machine Vision Conference, University of Manchester, Manchester, UK, pp. 383\u2013390 ( 2001)","key":"11_CR8","DOI":"10.5244\/C.15.40"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"R.C. Wilson","year":"2005","unstructured":"Wilson, R.C., Hancock, E.R., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Trans. on Pattern Anlysis and Machine Intelligence\u00a027, 1112\u20131124 (2005)","journal-title":"IEEE Trans. on Pattern Anlysis and Machine Intelligence"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.laa.2004.06.017","volume":"411","author":"R.B. Bapat","year":"2005","unstructured":"Bapat, R.B.: Distance matrix and Laplacian of a tree with attached graphs. Linear Algebra and its Applications\u00a0411, 295\u2013308 (2005)","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s11263-006-6993-y","volume":"69","author":"M.F. Demirci","year":"2006","unstructured":"Demirci, M.F., Shokoufandeh, A., Keselman, Y., Bretzner, L., Dickinson, S.: Object recognition as many-to-many feature matching. International Journal of Computer Vision\u00a069(2), 203\u2013222 (2006)","journal-title":"International Journal of Computer Vision"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y. Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. International Journal of Computer Vision\u00a040(2), 99\u2013121 (2000)","journal-title":"International Journal of Computer Vision"},{"doi-asserted-by":"crossref","unstructured":"Paraboschi, L., Biasotti, S., Falcidieno, B.: 3d scene comparison using topological graphs. In: Eurographics Italian Chapter, Trento (Italy), pp. 87\u201393 (2007)","key":"11_CR13","DOI":"10.1002\/0470020288.ch6"},{"issue":"12","key":"11_CR14","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"},{"key":"11_CR15","first-page":"871","volume":"2","author":"B. Mohar","year":"1991","unstructured":"Mohar, B.: The Laplacian spectrum of graphs. Graph Theory, Combinatorics, and Applications\u00a02, 871\u2013898 (1991)","journal-title":"Graph Theory, Combinatorics, and Applications"},{"key":"11_CR16","volume-title":"Matrix theory","author":"J.N. Franklin","year":"1993","unstructured":"Franklin, J.N.: Matrix theory. Dover Publications, Mineola (1993)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1111\/1467-8659.00669","volume":"22","author":"D. Chen","year":"2003","unstructured":"Chen, D., Ouhyoung, M., Tian, X., Shen, Y.: On visual similarity based 3D model retrieval. Computer Graphics Forum\u00a022, 223\u2013232 (2003)","journal-title":"Computer Graphics Forum"},{"unstructured":"Kazhdan, M., Funkhouser, T., Rusinkiewicz, S.: Rotation invariant spherical harmonic representation of 3D shape descriptors. In: Eurographics Symposium on Geometry Processing, pp. 167\u2013175 ( 2003)","key":"11_CR18"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1145\/1141911.1141993","volume":"25","author":"S. Dong","year":"2006","unstructured":"Dong, S., Bremer, P.T., Garland, M., Pascucci, V., Hart, J.C.: Spectral surface quadrangulation. ACM Trans. on Graphics\u00a025(3), 1057\u20131066 (2006)","journal-title":"ACM Trans. on Graphics"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72903-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T13:21:49Z","timestamp":1737379309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-72903-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729020","9783540729037"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72903-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}