{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:12:39Z","timestamp":1759133559421,"version":"3.41.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319490540"},{"type":"electronic","value":"9783319490557"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-49055-7_47","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"530-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Graph Edit Distance or Graph Edit Pseudo-Distance?"],"prefix":"10.1007","author":[{"given":"Francesc","family":"Serratosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Cort\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos-Francisco","family":"Moreno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"5","key":"47_CR1","doi-asserted-by":"publisher","first-page":"1260004","DOI":"10.1142\/S021800141260004X","volume":"26","author":"A Sol\u00e9","year":"2012","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the graph edit distance cost: properties and applications. Int. J. Pattern Recogn. Artif. Intell. 26(5), 1260004 (2012). (21 pages)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"3","key":"47_CR2","doi-asserted-by":"publisher","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 Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"47_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2015","unstructured":"Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recogn. 48, 291\u2013301 (2015)","journal-title":"Pattern Recogn."},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2013","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recogn. Artif. Intell. 28, 1450001 (2013)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"1","key":"47_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., et al.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"issue":"4","key":"47_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1(4), 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"issue":"7","key":"47_CR8","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/j.patcog.2003.12.011","volume":"37","author":"L He","year":"2004","unstructured":"He, L., et al.: Graph matching for object recognition and recovery. Pattern Recogn. Lett. 37(7), 1557\u20131560 (2004)","journal-title":"Pattern Recogn. Lett."},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1016\/j.eswa.2012.10.071","volume":"40","author":"F Serratosa","year":"2013","unstructured":"Serratosa, F., Cort\u00e9s, X., Sol\u00e9, A.: Component retrieval based on a database of graphs for hand-written electronic-scheme digitalisation. Expert Syst. Appl. 40, 2493\u20132502 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"47_CR10","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/34.954600","volume":"23","author":"S Berretti","year":"2001","unstructured":"Berretti, S., Del Bimbo, A., Vicario, E.: Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1089\u20131105 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"47_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A Wong","year":"1985","unstructured":"Wong, A., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. Trans. Pattern Anal. Mach. Intell. 7(5), 599\u2013609 (1985)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"47_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2006","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239\u2013247 (2006)","journal-title":"Inf. Sci."},{"issue":"3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/S0031-3203(02)00107-3","volume":"36","author":"F Serratosa","year":"2003","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Function-described graphs for modelling objects represented by attributed graphs. Pattern Recogn. 36(3), 781\u2013798 (2003)","journal-title":"Pattern Recogn."},{"doi-asserted-by":"crossref","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Efficient algorithms for matching attributed graphs and function-described graphs. In: Proceedings of 15th International Conference on Pattern Recognition, ICPR 2000, Barcelona, Spain, vol. 2, pp. 871\u2013876 (2000)","key":"47_CR14","DOI":"10.1109\/ICPR.2000.906212"},{"issue":"3","key":"47_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1142\/S0218001404003253","volume":"18","author":"A Sanfeliu","year":"2004","unstructured":"Sanfeliu, A., Serratosa, F., Alqu\u00e9zar, R.: Second-order random graphs for modelling sets of attributed graphs and their application to object learning and recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 375\u2013396 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0033229","volume-title":"Advances in Pattern Recognition","author":"R Alqu\u00e9zar","year":"1998","unstructured":"Alqu\u00e9zar, R., Sanfeliu, A., Serratosa, F.: Synthesis of function-described graphs. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds.) SSPR\u201998 and SPR\u201998. LNCS, vol. 1451, pp. 112\u2013121. Springer, Heidelberg (1998)"},{"issue":"8","key":"47_CR17","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1998","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett. 18(8), 689\u2013694 (1998)","journal-title":"Pattern Recogn. Lett."},{"issue":"9","key":"47_CR18","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H Bunke","year":"1999","unstructured":"Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function. Trans. Pattern Anal. Mach. Intell. 21(9), 917\u2013922 (1999)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"47_CR19","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T Caetano","year":"2009","unstructured":"Caetano, T., et al.: Learning graph matching. Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"key":"47_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.patrec.2015.07.010","volume":"65","author":"M Ferrer","year":"2015","unstructured":"Ferrer, M., Serratosa, F., Riesen, K.: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recogn. Lett. 65, 29\u201336 (2015)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"47_CR21","doi-asserted-by":"publisher","first-page":"1650005","DOI":"10.1142\/S0218001416500051","volume":"30","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph matching substitution weights based on the ground truth node correspondence. Int. J. Pattern Recogn. Artif. Intell. 30(2), 1650005 (2016). (22 pages)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"47_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","volume":"56","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph-matching edit-costs based on the optimality of the Oracle\u2019s node correspondences. Pattern Recogn. Lett. 56, 22\u201329 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"47_CR23","volume-title":"Handbook of Fingerprint Recognition","author":"AK Jain","year":"2003","unstructured":"Jain, A.K., Maltoni, D.: Handbook of Fingerprint Recognition. Springer, New York (2003)"},{"key":"47_CR24","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. Cybern. Control Theory 10, 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl. Cybern. Control Theory"},{"issue":"5","key":"47_CR25","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.patcog.2005.12.005","volume":"39","author":"F Serratosa","year":"2006","unstructured":"Serratosa, F., Sanfeliu, A.: Signatures versus histograms: definitions, distances and algorithms. Pattern Recogn. 39(5), 921\u2013934 (2006)","journal-title":"Pattern Recogn."},{"issue":"7","key":"47_CR26","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"key":"47_CR27","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recogn. Lett. 45, 244\u2013250 (2014)","journal-title":"Pattern Recogn. Lett."},{"key":"47_CR28","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.imavis.2015.06.005","volume":"40","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F.: Computation of graph edit distance: reasoning about optimality and speed-up. Image Vis. Comput. 40, 38\u201348 (2015)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"47_CR29","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recogn. Artif. Intell. 29(2), 1550010 (2015)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"47_CR30","series-title":"Encyclopaedia of Mathematical Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61265-7","volume-title":"General Topology I: Basic Concepts and Constructions Dimension Theory","author":"AV Arkhangel\u2019skii","year":"1990","unstructured":"Arkhangel\u2019skii, A.V., Pontryagin, L.S.: General Topology I: Basic Concepts and Constructions Dimension Theory. Encyclopaedia of Mathematical Sciences. Springer, Heidelberg (1990)"},{"unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/","key":"47_CR31"},{"unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/SW","key":"47_CR32"}],"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-319-49055-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:15:05Z","timestamp":1749687305000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e9rida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}