{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:07:37Z","timestamp":1759133257324,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"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_11","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"121-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Cort\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaspar","family":"Riesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/S0031-3203(01)00066-8","volume":"35","author":"A Sanfeliu","year":"2002","unstructured":"Sanfeliu, A., Alqu\u00e9zar, R., Andrade, J., Climent, J., Serratosa, F., Verg\u00e9s, J.: Graph-based representations and techniques for image processing and image analysis. Pattern Recogn. 35(3), 639\u2013650 (2002)","journal-title":"Pattern Recogn."},{"issue":"3","key":"11_CR2","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. Artfi. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artfi. Intell."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38221-5_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M Vento","year":"2013","unstructured":"Vento, M.: A one hour trip in the world of graphs, looking at the papers of the last ten years. In: Artner, N.M., Haxhimusa, Y., Jiang, X., Kropatsch, W.G. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 1\u201310. Springer, Heidelberg (2013)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","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(1), 1450001 (2014)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"e0145846","DOI":"10.1371\/journal.pone.0145846","volume":"11","author":"G Sanroma","year":"2016","unstructured":"Sanroma, G., Penate-Sanchez, A., Alquezar, R., Serratosa, F., Moreno-Noguer, F., Andrade-Cetto, J., Gonzalez, M.A.: MSClique: multiple structure discovery through the maximum weighted clique problem. PLoS ONE 11(1), e0145846 (2016)","journal-title":"PLoS ONE"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1093\/bioinformatics\/bti1007","volume":"21","author":"K Borgwardt","year":"2005","unstructured":"Borgwardt, K., Ong, C., Sch\u00f6nauer, S., Vishwanathan, S., Smola, A., Kriegel, H.-P.: Protein function prediction via graph kernels. Bioinformatics 21(1), 47\u201356 (2005)","journal-title":"Bioinformatics"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1021\/ci050039t","volume":"45","author":"P Mah\u00e9","year":"2005","unstructured":"Mah\u00e9, P., Ueda, N., Akutsu, T., Perret, J., Vert, J.: Graph kernels for molecular structure-activity relationship analysis with support vector machines. J. Chem. Inf. Model. 45(4), 939\u2013951 (2005)","journal-title":"J. Chem. Inf. Model."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-70659-3_8","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"B Luo","year":"2002","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: Spectral feature vectors for graph clustering. In: Caelli, T.M., Amin, A., Duin, R.P., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 83\u201393. Springer, Heidelberg (2002)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-70659-3_13","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"S Kosinov","year":"2002","unstructured":"Kosinov, S., Caelli, T.M.: Inexact multisubgraph matching using graph eigenspace and clustering models. In: Caelli, T.M., Amin, A., Duin, R.P., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 133\u2013142. Springer, Heidelberg (2002)"},{"issue":"7","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"RC Wilson","year":"2005","unstructured":"Wilson, R.C., Hancock, E.R., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1112\u20131124 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patcog.2005.06.014","volume":"39","author":"H Qiu","year":"2006","unstructured":"Qiu, H., Hancock, E.R.: Graph matching and clustering using spectral partitions. Pattern Recogn. 39(1), 22\u201334 (2006)","journal-title":"Pattern Recogn."},{"key":"11_CR13","unstructured":"Ramon, J., G\u00e4rtner, T.: Expressivity versus efficiency of graph kernels. In: First International Workshop on Mining Graphs, Trees and Sequences, pp. 65\u201374 (2003)"},{"key":"11_CR14","unstructured":"Borgwardt, K., Petri, T., Kriegel, H.-P., Vishwanathan, S.: An efficient sampling scheme for comparison of large graphs. In: International Workshop on Mining and Learning with Graphs (2007)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Vishwanathan, S.V.N., Borgwardt, K., Schraudolph, N.N.: Fast computation of graph kernels. In: Annual Conference on Neural Information Processing Systems, pp. 1449\u20131456. MIT Press (2006)","DOI":"10.7551\/mitpress\/7503.003.0186"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-20844-7_12","volume-title":"Graph-Based Representations in Pattern Recognition","author":"B Ga\u00fcz\u00e8re","year":"2011","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D.: Two new graph kernels and applications to chemoinformatics. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 112\u2013121. Springer, Heidelberg (2011)"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.patcog.2014.07.029","volume":"48","author":"B Gauzere","year":"2015","unstructured":"Gauzere, B., Grenier, P.A., Brun, L., Villemin, D.: Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics. Pattern Recogn. 48(2), 356\u2013367 (2015)","journal-title":"Pattern Recogn."},{"key":"11_CR18","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, 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"11_CR19","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.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. (Part B) 13(3), 353\u2013363 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern. (Part B)"},{"key":"11_CR20","doi-asserted-by":"crossref","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 [21 p.] (2012)","DOI":"10.1142\/S021800141260004X"},{"issue":"4","key":"11_CR21","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(4), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"key":"11_CR22","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":"11_CR23","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":"02","key":"11_CR24","doi-asserted-by":"crossref","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"Francesc Serratosa","year":"2015","unstructured":"Serratosa, F.: Speeding up fast bipartite graph matching trough a new cost matrix. Int. J. Pattern Recogn. Artif. Intell. 29(2),1550010 [17 p.] (2015)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"11_CR25","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."},{"key":"11_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K Riesen","year":"2015","unstructured":"Riesen, K., Ferrer, M., Fischer, A., Bunke, H.: Approximation of graph edit distance in quadratic time. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 3\u201312. Springer, Heidelberg (2015)"},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.patcog.2014.10.033","volume":"48","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F., Cort\u00e9s, X.: Interactive graph-matching using active query strategies. Pattern Recogn. 48(4), 1364\u20131373 (2015)","journal-title":"Pattern Recogn."},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.eswa.2014.07.051","volume":"42","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F.: An interactive method for the image alignment problem based on partially supervised correspondence. Expert Syst. Appl. 42(1), 179\u2013192 (2015)","journal-title":"Expert Syst. Appl."},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.patrec.2012.04.008","volume":"33","author":"G Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0, G., Alqu\u00e9zar, R., Serratosa, F., Herrera, B.: Smooth point-set registration using neighbouring constraints. Pattern Recogn. Lett. 33, 2029\u20132037 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"11_CR31","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.cviu.2011.10.009","volume":"116","author":"G Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0, G., Alqu\u00e9zar, R., Serratosa, F.: A new graph matching method for point-set correspondence using the EM algorithm and softassign. Comput. Vis. Image Underst. 116(2), 292\u2013304 (2012)","journal-title":"Comput. Vis. Image Underst."},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.patrec.2015.08.003","volume":"65","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F., Cort\u00e9s, X.: Graph edit distance: moving from global to local structure to solve the graph-matching problem. Pattern Recogn. Lett. 65, 204\u2013210 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logistics Q."},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/34.232073","volume":"15","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Klanderman, G.A., Kl, G.A., Rucklidge, W.J.: Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell. 15, 850\u2013863 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR35","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"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/ICPR.2002.1047428","volume":"4","author":"G Peris","year":"2002","unstructured":"Peris, G., Marzal, A.: Fast cyclic edit distance computation with weighted edit costs in classification. Int. Conf. Pattern Recogn. 4, 184\u2013187 (2002)","journal-title":"Int. Conf. Pattern Recogn."},{"issue":"5","key":"11_CR37","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":"8","key":"11_CR38","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1142\/S0218001408006880","volume":"22","author":"F Serratosa","year":"2008","unstructured":"Serratosa, F., Sanrom\u00e0, G.: A fast approximation of the earth-movers distance between multi-dimensional histograms. Int. J. Pattern Recognit. Artif. Intell. 22(8), 1539\u20131558 (2008)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) Structural, Syntactic, and Statistical Pattern Recognition. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:01:15Z","timestamp":1710262875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_11","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"}]}}