{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:45:13Z","timestamp":1742939113473,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031805066"},{"type":"electronic","value":"9783031805073"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-80507-3_1","type":"book-chapter","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:07:44Z","timestamp":1738256864000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Differentiable Approximation of\u00a0the\u00a0Graph Edit Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7676-2820","authenticated-orcid":false,"given":"Julia","family":"Wallnig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1658-0527","authenticated-orcid":false,"given":"Luc","family":"Brun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9980-2641","authenticated-orcid":false,"given":"Benoit","family":"Ga\u00fcz\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4581-7570","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Bougleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7182-8062","authenticated-orcid":false,"given":"Florian","family":"Yger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8651-750X","authenticated-orcid":false,"given":"David B.","family":"Blumenthal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,31]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/J.PATREC.2017.10.007","volume":"100","author":"Z Abu-Aisheh","year":"2017","unstructured":"Abu-Aisheh, Z., et al.: Graph edit distance contest: results and future challenges. Pattern Recogn. Lett. 100, 96\u2013103 (2017). https:\/\/doi.org\/10.1016\/J.PATREC.2017.10.007","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00778-019-00544-1","volume":"29","author":"DB Blumenthal","year":"2020","unstructured":"Blumenthal, D.B., Boria, N., Gamper, J., Bougleux, S., Brun, L.: Comparing heuristics for graph edit distance computation. VLDB J. 29(1), 419\u2013458 (2020). https:\/\/doi.org\/10.1007\/s00778-019-00544-1","journal-title":"VLDB J."},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TKDE.2017.2772243","volume":"30","author":"DB Blumenthal","year":"2018","unstructured":"Blumenthal, D.B., Gamper, J.: Improved lower bounds for graph edit distance. IEEE Trans. Knowl. Data Eng. 30(3), 503\u2013516 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2772243","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.patrec.2018.05.002","volume":"134","author":"DB Blumenthal","year":"2020","unstructured":"Blumenthal, D.B., Gamper, J.: On the exact computation of the graph edit distance. Pattern Recogn. Lett. 134, 46\u201357 (2020). https:\/\/doi.org\/10.1016\/j.patrec.2018.05.002","journal-title":"Pattern Recogn. Lett."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.patrec.2023.02.017","volume":"167","author":"N Boria","year":"2023","unstructured":"Boria, N., Kiederle, J., Yger, F., Blumenthal, D.B.: The edge-preservation similarity for comparing rooted, unordered, node-labeled trees. Pattern Recogn. Lett. 167, 189\u2013195 (2023). https:\/\/doi.org\/10.1016\/j.patrec.2023.02.017","journal-title":"Pattern Recogn. Lett."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.patrec.2016.10.001","volume":"87","author":"S Bougleux","year":"2017","unstructured":"Bougleux, S., Brun, L., Carletti, V., Foggia, P., Ga\u00fcz\u00e8re, B., Vento, M.: Graph edit distance as a quadratic assignment problem. Pattern Recogn. Lett. 87, 38\u201346 (2017). https:\/\/doi.org\/10.1016\/j.patrec.2016.10.001","journal-title":"Pattern Recogn. Lett."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.patrec.2018.03.032","volume":"134","author":"S Bougleux","year":"2020","unstructured":"Bougleux, S., Ga\u00fcz\u00e8re, B., Blumenthal, D.B., Brun, L.: Fast linear sum assignment with error-correction and no cost constraints. Pattern Recogn. Lett. 134, 37\u201345 (2020). https:\/\/doi.org\/10.1016\/j.patrec.2018.03.032","journal-title":"Pattern Recogn. Lett."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-58961-9_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S Bougleux","year":"2017","unstructured":"Bougleux, S., Ga\u00fcz\u00e8re, B., Brun, L.: A Hungarian algorithm for error-correcting graph matching. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 118\u2013127. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_11"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Brun, L., Ga\u00fcz\u00e8re, B., Renton, G., Bougleux, S., Yger, F.: A differentiable approximation for the linear sum assignment problem with edition. In: ICPR 2022, pp. 3822\u20133828. IEEE (2022). https:\/\/doi.org\/10.1109\/ICPR56361.2022.9956203","DOI":"10.1109\/ICPR56361.2022.9956203"},{"issue":"4","key":"1_CR10","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). https:\/\/doi.org\/10.1016\/0167-8655(83)90033-8","journal-title":"Pattern Recogn. Lett."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.patrec.2019.05.001","volume":"125","author":"X Cort\u00e9s","year":"2019","unstructured":"Cort\u00e9s, X., Conte, D., Cardot, H.: Learning edit cost estimation models for graph edit distance. Pattern Recogn. Lett. 125, 256\u2013263 (2019). https:\/\/doi.org\/10.1016\/j.patrec.2019.05.001","journal-title":"Pattern Recogn. Lett."},{"issue":"1\u20132","key":"1_CR12","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. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (1955). https:\/\/doi.org\/10.1002\/nav.3800020109","journal-title":"Nav. Res. Logist. Q."},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational optimal transport: with applications to data science. Found. Trends\u00ae Mach. Learn. 11(5\u20136), 355\u2013607 (2019). https:\/\/doi.org\/10.1561\/2200000073","DOI":"10.1561\/2200000073"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.patrec.2021.02.019","volume":"146","author":"E Rica","year":"2021","unstructured":"Rica, E., \u00c1lvarez, S., Serratosa, F.: On-line learning the graph edit distance costs. Pattern Recogn. Lett. 146, 55\u201362 (2021). https:\/\/doi.org\/10.1016\/j.patrec.2021.02.019","journal-title":"Pattern Recogn. Lett."},{"issue":"7","key":"1_CR15","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). https:\/\/doi.org\/10.1016\/j.imavis.2008.04.004","journal-title":"Image Vis. Comput."},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn, R., Knopp, P.: Concerning nonnegative matrices and doubly stochastic matrices. Pac. J. Math. 21(2), 343\u2013348 (1967). https:\/\/doi.org\/10.2140\/pjm.1967.21.343","journal-title":"Pac. J. Math."},{"issue":"9","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1089\/CMB.2019.0512","volume":"27","author":"F Wang","year":"2020","unstructured":"Wang, F., Akutsu, T., Mori, T.: Comparison of pseudoknotted RNA secondary structures by topological centroid identification and tree edit distance. J. Comput. Biol. 27(9), 1443\u20131451 (2020). https:\/\/doi.org\/10.1089\/CMB.2019.0512","journal-title":"J. Comput. Biol."},{"issue":"7","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1007\/s10994-021-06009-3","volume":"110","author":"T Yoshida","year":"2021","unstructured":"Yoshida, T., Takeuchi, I., Karasuyama, M.: Distance metric learning for graph structured data. Mach. Learn. 110(7), 1765\u20131811 (2021). https:\/\/doi.org\/10.1007\/s10994-021-06009-3","journal-title":"Mach. Learn."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow. 2(1), 25\u201336 (2009). https:\/\/doi.org\/10.14778\/1687627.1687631","journal-title":"Proc. VLDB Endow."}],"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-031-80507-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:07:45Z","timestamp":1738256865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80507-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031805066","9783031805073"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80507-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"31 January 2025","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":"Venice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/s-sspr-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}