{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:15:37Z","timestamp":1757610937210,"version":"3.44.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031703614"},{"type":"electronic","value":"9783031703621"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-70362-1_18","type":"book-chapter","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T03:03:03Z","timestamp":1724900583000},"page":"300-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximating the\u00a0Graph Edit Distance with\u00a0Compact Neighborhood Representations"],"prefix":"10.1007","author":[{"given":"Franka","family":"Bause","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Permann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils M.","family":"Kriege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Aisheh, Z., Raveaux, R., Ramel, J.Y., Martineau, P.: An exact graph edit distance algorithm for solving pattern recognition problems. In: ICPRAM (2015)","DOI":"10.5220\/0005209202710278"},{"key":"18_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston (1974)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., Wang, W.: SimGNN: a neural network approach to fast graph similarity computation. In: ACM WSDM (2019)","DOI":"10.1145\/3289600.3290967"},{"issue":"1","key":"18_CR4","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)","journal-title":"VLDB J."},{"issue":"3","key":"18_CR5","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)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR6","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)","journal-title":"Pattern Recogn. Lett."},{"key":"18_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 Recognit. Lett. 134, 37\u201345 (2020)","journal-title":"Pattern Recognit. Lett."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Carletti, V., Ga\u00fcz\u00e8re, B., Brun, L., Vento, M.: Approximate graph edit distance computation combining bipartite matching and exact neighborhood substructure distance. GbRPR (2015)","DOI":"10.1007\/978-3-319-18224-7_19"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/j.knosys.2018.10.002","volume":"163","author":"X Chen","year":"2019","unstructured":"Chen, X., Huo, H., Huan, J., Vitter, J.S.: An efficient algorithm for graph edit distance computation. Knowl.-Based Syst. 163, 762\u2013775 (2019)","journal-title":"Knowl.-Based Syst."},{"key":"18_CR10","first-page":"1450001","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. IJPRAI 28, 1450001 (2014)","journal-title":"IJPRAI"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1021\/acs.jcim.8b00820","volume":"59","author":"C Garcia-Hernandez","year":"2019","unstructured":"Garcia-Hernandez, C., Fern\u00e1ndez, A., Serratosa, F.: Ligand-based virtual screening using graph edit distance as molecular similarity measure. J. Chem. Inform. Model. 59(4), 1410\u20131421 (2019)","journal-title":"J. Chem. Inform. Model."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-662-44415-3_8","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"B Ga\u00fcz\u00e8re","year":"2014","unstructured":"Ga\u00fcz\u00e8re, B., Bougleux, S., Riesen, K., Brun, L.: Approximate graph edit distance guided by bipartite matching of bags of walks. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 73\u201382. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44415-3_8"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s00224-017-9776-7","volume":"61","author":"AV Goldberg","year":"2017","unstructured":"Goldberg, A.V., Hed, S., Kaplan, H., Tarjan, R.E.: Minimum-cost flows in unit-capacity networks. Theory Comput. Syst. 61(4), 987\u20131010 (2017)","journal-title":"Theory Comput. Syst."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Gouda, K., Hassaan, M.: CSI_GED: an efficient approach for graph edit similarity computation. In: International Conference on Data Engineering, ICDE (2016)","DOI":"10.1109\/ICDE.2016.7498246"},{"issue":"11","key":"18_CR15","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/3372123","volume":"63","author":"M Grohe","year":"2020","unstructured":"Grohe, M., Schweitzer, P.: The graph isomorphism problem. Commun. ACM 63(11), 128\u2013134 (2020)","journal-title":"Commun. ACM"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"2005","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 325\u2013340 (2005)","journal-title":"Computing"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Kriege, N.M., Giscard, P., Bause, F., Wilson, R.C.: Computing optimal assignments in linear time for approximate graph matching. In: ICDM (2019)","DOI":"10.1109\/ICDM.2019.00045"},{"key":"18_CR18","unstructured":"Kriege, N.M., Giscard, P.L., Wilson, R.C.: On valid optimal assignment kernels and applications to graph classification. In: NIPS 2016 (2016)"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2020","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Netw. Sci. 5, 1\u201342 (2020)","journal-title":"Appl. Netw. Sci."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.patcog.2017.07.029","volume":"72","author":"J Lerouge","year":"2017","unstructured":"Lerouge, J., Abu-Aisheh, Z., Raveaux, R., H\u00e9roux, P., Adam, S.: New binary linear programming formulation to compute the graph edit distance. Pattern Recognit. 72, 254\u2013265 (2017)","journal-title":"Pattern Recognit."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Morris, C., Fey, M., Kriege, N.M.: The power of the Weisfeiler-Leman algorithm for machine learning with graphs. In: IJCAI 2021, pp. 4543\u20134550 (2021)","DOI":"10.24963\/ijcai.2021\/618"},{"key":"18_CR22","unstructured":"Morris, C., Kriege, N.M., Bause, F., Kersting, K., Mutzel, P., Neumann, M.: Tudataset: a collection of benchmark datasets for learning with graphs. GRL+ (2020)"},{"key":"18_CR23","unstructured":"Morris, C., et al.: Weisfeiler and Leman go machine learning: the story so far. CoRR (2021)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Morris, C., et al.: Weisfeiler and Leman go neural: higher-order graph neural networks. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33014602"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"JR Munkres","year":"1957","unstructured":"Munkres, J.R.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"8","key":"18_CR26","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.14778\/3594512.3594514","volume":"16","author":"C Piao","year":"2023","unstructured":"Piao, C., Xu, T., Sun, X., Rong, Y., Zhao, K., Cheng, H.: Computing graph edit distance via neural graph matching. Proc. VLDB Endow. 16(8), 1817\u20131829 (2023)","journal-title":"Proc. VLDB Endow."},{"key":"18_CR27","unstructured":"Ramshaw, L., Tarjan, R.E.: On minimum-cost assignments in unbalanced bipartite graphs. Technical report, HPL-2012-40, HP Laboratories (2012)"},{"issue":"7","key":"18_CR28","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. 27(7), 950\u2013959 (2009)","journal-title":"Image Vision Comput."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Schenker, A., Kandel, A., Bunke, H., Last, M.: Graph-Theoretic Techniques for Web Content Mining. Series in Machine Perception and AI (2005)","DOI":"10.1142\/9789812569455"},{"issue":"7","key":"18_CR30","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1007\/s10994-022-06131-w","volume":"111","author":"TH Schulz","year":"2022","unstructured":"Schulz, T.H., Horv\u00e1th, T., Welke, P., Wrobel, S.: A generalized Weisfeiler-Lehman graph kernel. Mach. Learn. 111(7), 2601\u20132629 (2022)","journal-title":"Mach. Learn."},{"issue":"10","key":"18_CR31","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1039\/C9OB02765C","volume":"18","author":"S Sengupta","year":"2020","unstructured":"Sengupta, S., Mehta, G.: Macrocyclization via C-H functionalization: a new paradigm in macrocycle synthesis. Org. Biomol. Chem. 18(10), 1851\u20131876 (2020)","journal-title":"Org. Biomol. Chem."},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Serratosa, F.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recognit. Artif. Intell. 29(2), 1550010:1\u20131550010:17 (2015)","DOI":"10.1142\/S021800141550010X"},{"issue":"77","key":"18_CR33","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. JMLR 12(77), 2539\u20132561 (2011)","journal-title":"JMLR"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Stauffer, M., Tschachtli, T., Fischer, A., Riesen, K.: A survey on applications of bipartite graph edit distance. GbRPR (2017)","DOI":"10.1007\/978-3-319-58961-9_22"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-32047-8_27","volume-title":"Similarity Search and Applications","author":"BK St\u00f6cker","year":"2019","unstructured":"St\u00f6cker, B.K., Sch\u00e4fer, T., Mutzel, P., K\u00f6ster, J., Kriege, N., Rahmann, S.: Protein complex similarity based on Weisfeiler-Lehman labeling. In: Amato, G., Gennaro, C., Oria, V., Radovanovi\u0107, M. (eds.) SISAP 2019. LNCS, vol. 11807, pp. 308\u2013322. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32047-8_27"},{"key":"18_CR36","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: 7th International Conference on Learning Representations, ICLR 2019 (2019)"},{"issue":"1","key":"18_CR37","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)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70362-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T17:49:29Z","timestamp":1756921769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70362-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031703614","9783031703621"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70362-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","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":"8 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}