{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:09:38Z","timestamp":1759133378845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"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_8","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"77-86","source":"Crossref","is-referenced-by-count":7,"title":["A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Ferrer","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","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"SMC-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\u00a0SMC-13(3), 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"4","key":"8_CR2","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 Recognition Letters\u00a01(4), 245\u2013253 (1983)","journal-title":"Pattern Recognition Letters"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11527923_20","volume-title":"Audio- and Video-Based Biometric Person Authentication","author":"M. Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Kanade, T., Jain, A., Ratha, N.K. (eds.) AVBPA 2005. LNCS, vol.\u00a03546, pp. 191\u2013200. Springer, Heidelberg (2005)"},{"issue":"3","key":"8_CR4","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.\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X. Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl.\u00a013(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-24838-5_8","volume-title":"Experimental and Efficient Algorithms","author":"M.C. Boeres","year":"2004","unstructured":"Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 100\u2013113. Springer, Heidelberg (2004)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-31988-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Sorlin","year":"2005","unstructured":"Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol.\u00a03434, pp. 172\u2013182. Springer, Heidelberg (2005)"},{"issue":"8","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D. Justice","year":"2006","unstructured":"Justice, D., Hero, A.O.: A binary linear programming formulation of the graph edit distance. IEEE Trans. PAMI\u00a028(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. PAMI"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11815921_17","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR&SPR 2006. LNCS, vol.\u00a04109, pp. 163\u2013172. Springer, Heidelberg (2006)"},{"issue":"7","key":"8_CR10","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":"8_CR11","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":"8_CR12","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-11656-3_11","volume-title":"Artificial Neural Networks in Pattern Recognition","author":"K. Riesen","year":"2014","unstructured":"Riesen, K., Fischer, A., Bunke, H.: Combining bipartite graph matching and beam search for graph edit distance approximation. In: El Gayar, N., Schwenker, F., Suen, C. (eds.) ANNPR 2014. LNCS, vol.\u00a08774, pp. 117\u2013128. Springer, Heidelberg (2014)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da\u00a0Vitoria\u00a0Lobo, et\u00a0al. (eds.) [15], pp. 287\u2013297","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","year":"2008","unstructured":"da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.): SSPR&SPR 2008. LNCS, vol.\u00a05342. 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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:59:19Z","timestamp":1676941159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}