{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:02:07Z","timestamp":1746417727173,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444146"},{"type":"electronic","value":"9783662444153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44415-3_26","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T04:40:31Z","timestamp":1407904831000},"page":"253-262","source":"Crossref","is-referenced-by-count":1,"title":["Edit Distance Computed by Fast Bipartite Graph Matching"],"prefix":"10.1007","author":[{"given":"Francesc","family":"Serratosa","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Cort\u00e9s","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"26_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":"26_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":"26_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":"26_CR4","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.patrec.2011.08.012","volume":"33","author":"R. Edwin","year":"2012","unstructured":"Edwin, R., Hancock, 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":"26_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":"26_CR6","doi-asserted-by":"publisher","first-page":"7302","DOI":"10.1016\/j.eswa.2012.01.088","volume":"39","author":"F. Serratosa","year":"2012","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Am\u00e9zquita, N.: A Probabilistic Integrated Object Recognition and Tracking Framework. Expert Systems With Applications\u00a039, 7302\u20137318 (2012)","journal-title":"Expert Systems With Applications"},{"issue":"1","key":"26_CR7","first-page":"1","volume":"27","author":"A. Sol\u00e9-Ribalta","year":"2013","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: Graduated Assignment Algorithm for Multiple Graph Matching based on a Common Labelling. International Journal of Pattern Recognition and Artificial Intelligence, IJPRAI\u00a027 (1), 1\u201327 (2013)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence, IJPRAI"},{"issue":"7","key":"26_CR8","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.cviu.2010.12.007","volume":"115","author":"A. Sol\u00e9","year":"2011","unstructured":"Sol\u00e9, A., Serratosa, F.: Models and Algorithms for computing the Common Labelling of a set of Attributed Graphs. Computer Vision and Image Understanding, CVIU\u00a0115(7), 929\u2013945 (2011)","journal-title":"Computer Vision and Image Understanding, CVIU"},{"issue":"2","key":"26_CR9","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. Computer Vision and Image Understanding, CVIU\u00a0116(2), 292\u2013304 (2012)","journal-title":"Computer Vision and Image Understanding, CVIU"},{"key":"26_CR10","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 Recognition Letters, PRL\u00a033, 2029\u20132037 (2012)","journal-title":"Pattern Recognition Letters, PRL"},{"key":"26_CR11","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":"26_CR12","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":"26_CR13","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"},{"issue":"7","key":"26_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"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE TPAMI\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE TPAMI"},{"key":"26_CR16","unstructured":"Rebagliati, N., Sol\u00e9, A., Pelillo, M., Serratosa, F.: Computing the Graph Edit Distance Using Dominant Sets. In: International Conference on Pattern Recognition, ICPR 2012, Tsukuba, Japan, pp. 1080\u20131083 (2012)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Wong, A., You, M.: Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition. Transaction on Pattern Analysis and Machine Intelligence\u00a0PAMI-7(5), 599\u2013609 (1985)","DOI":"10.1109\/TPAMI.1985.4767707"},{"issue":"3","key":"26_CR18","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 Transactions on Systems, Man, and Cybernetics\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"1","key":"26_CR19","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 Analysis and Applications\u00a013(1), 113\u2013129 (2010)","journal-title":"Pattern Analysis and Applications"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the Graph Edit Distance cost: Properties and Applications. International Journal of Pattern Recognition and Artificial Intelligence\u00a026(5) (2012)","DOI":"10.1142\/S021800141260004X"},{"issue":"9","key":"26_CR21","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. on Pattern Analysis and Machine Intelligence\u00a021(9), 917\u2013922 (1999)","journal-title":"Trans. on Pattern Analysis and Machine Intelligence"},{"key":"26_CR22","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":"26_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H. Kuhn","year":"1955","unstructured":"Kuhn, H.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistic Quarterly"},{"issue":"12","key":"26_CR24","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1145\/362919.362945","volume":"14","author":"F. Bourgeois","year":"1971","unstructured":"Bourgeois, F., Lassalle, J.: An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Communications of the ACM\u00a014(12), 802\u2013804 (1971)","journal-title":"Communications of the ACM"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Serratosa, F.: Fast Computation of Bipartite Graph Matching. Pattern Recognition Letters (2014)","DOI":"10.1016\/j.patrec.2014.04.015"},{"key":"26_CR26","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)"},{"key":"26_CR27","unstructured":"http:\/\/iapr-tc15.greyc.fr\/links.html"},{"key":"26_CR28","unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/SW\/"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Funada, J., et al.: Feature Extraction Method for Palmprint Considering Elimination of Creases. In: Proc. 14th Int. Conf. Pattern Recognition, pp. 1849\u20131854 (1998)","DOI":"10.1109\/ICPR.1998.712091"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Jain, A.K., Feng, J.: Latent Palmprint Matching. IEEE Trans. on PAMI (2009)","DOI":"10.1109\/TPAMI.2008.242"},{"key":"26_CR31","unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44415-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:56:11Z","timestamp":1746334571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44415-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444146","9783662444153"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44415-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}