{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T08:11:49Z","timestamp":1761984709828,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182230"},{"type":"electronic","value":"9783319182247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-18224-7_23","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"231-241","source":"Crossref","is-referenced-by-count":2,"title":["On the Influence of Node Centralities on Graph Edit Distance for Graph Classification"],"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":"Carlos F.","family":"Moreno-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"23_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 Recognition\u00a035(3), 639\u2013650 (2002)","journal-title":"Pattern Recognition"},{"issue":"3","key":"23_CR2","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years Of Graph Matching In Pattern Recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"23_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: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol.\u00a07877, pp. 1\u201310. Springer, Heidelberg (2013)"},{"issue":"7","key":"23_CR4","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.patrec.2011.08.012","volume":"33","author":"E.R. Hancock","year":"2012","unstructured":"Hancock, E.R., Wilson, R.C.: Pattern analysis with graphs: Parallel work at Bern and York. Pattern Recognition Letters\u00a033(7), 833\u2013841 (2012)","journal-title":"Pattern Recognition Letters"},{"key":"23_CR5","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-Ribalta, A.: Component Retrieval based on a Database of Graphs for Hand-Written Electronic-Scheme Digitalisation. Expert Systems With Applications, ESWA\u00a040, 2493\u20132502 (2013)","journal-title":"Expert Systems With Applications, ESWA"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the Graph Edit Distance cost: Properties and Applications. International\u00a0Journal of Pattern Recognition and Artificial Intelligence 26(5) (2012)","DOI":"10.1142\/S021800141260004X"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-70659-3_26","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Estimating the Joint Probability Distribution of Random Vertices and Arcs by Means of Second-Order Random Graphs. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 252\u2013262. Springer, Heidelberg (2002)"},{"issue":"9","key":"23_CR8","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1016\/j.patcog.2009.01.034","volume":"42","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F.: Median graphs: A genetic approach based on new theoretical properties. Pattern Recognition\u00a042(9), 2003\u20132012 (2009)","journal-title":"Pattern Recognition"},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.patrec.2008.12.014","volume":"30","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F.: Median graph: A new exact algorithm using a distance based on the maximum common subgraph. Pattern Recognition Letters\u00a030(5), 579\u2013588 (2009)","journal-title":"Pattern Recognition Letters"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-70659-3_26","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Estimating the Joint Probability Distribution of Random Vertices and Arcs by Means of Second-Order Random Graphs. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 252\u2013262. Springer, Heidelberg (2002)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/3-540-63507-6_263","volume-title":"Image Analysis and Processing","author":"F. Serratosa","year":"1997","unstructured":"Serratosa, F., Sanfeliu, A.: Function-Described Graphs applied to 3D object recognition. In: Del Bimbo, A. (ed.) ICIAP 1997. LNCS, vol.\u00a01310, pp. 701\u2013708. Springer, Heidelberg (1997)"},{"key":"23_CR12","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 Recognition Letters\u00a045, 244\u2013250 (2014)","journal-title":"Pattern Recognition Letters"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Serratosa, F.: Speeding up Fast Bipartite Graph Matching trough a new cost matrix, International Journal of Pattern Recognition and Artificial Intelligence 29(2) (2015)","DOI":"10.1142\/S021800141550010X"},{"issue":"7","key":"23_CR14","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 Vision Comput.\u00a027(7), 950\u2013959 (2009)","journal-title":"Image Vision Comput."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial & Applied Mathematics\u00a05, 32\u201338 (1957)","journal-title":"Journal of the Society for Industrial & Applied Mathematics"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, T.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing\u00a038, 325\u2013340 (1987)","journal-title":"Computing"},{"issue":"1","key":"23_CR17","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 Systems With Applications\u00a042(1), 179\u2013192 (2015)","journal-title":"Expert Systems With Applications"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1360","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 Recognition\u00a048, 1360\u20131369 (2015)","journal-title":"Pattern Recognition"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H., Fischer, A.: Improving Graph Edit Distance Approximation by Centrality Measures. In: International Congress on Pattern Recognition (2014)","DOI":"10.1109\/ICPR.2014.670"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning Graph-Matching Edit-Costs based on the Optimality of the Oracle\u2019s Node Correspondences. Pattern Recognition Letters (2015)","DOI":"10.1016\/j.patrec.2015.01.009"},{"key":"23_CR21","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 Doklady, Cybernetics and Control Theory\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady, Cybernetics and Control Theory"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Peris, G., Marzal, A.: Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification. In: ICPR 2002, vol.\u00a04, pp. 184\u2013187 (2002)","DOI":"10.1109\/ICPR.2002.1047428"},{"key":"23_CR23","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: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"}],"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-319-18224-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T19:59:21Z","timestamp":1748375961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}