{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:46:02Z","timestamp":1782535562297,"version":"3.54.5"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032297297","type":"print"},{"value":"9783032297303","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29730-3_13","type":"book-chapter","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:07:02Z","timestamp":1782533222000},"page":"223-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Benchmark First: Defining Tasks for\u00a0Graph Transformation Learning"],"prefix":"10.1007","author":[{"given":"Adam","family":"Machowczyk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Panolan, F., Saurabh, S., Zehavi, M.: Simultaneous feedback edge set: a parameterized perspective. Algorithmica 83(2), 753\u2013774 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00773-9","DOI":"10.1007\/s00453-020-00773-9"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972). https:\/\/doi.org\/10.1137\/0201008","DOI":"10.1137\/0201008"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Al-garadi, M.A., Varathan, K.D., Ravana, S.D.: Identification of influential spreaders in online social networks using interaction weighted k-core decomposition method. XXPhys. A 468, 278\u2013288 (2017)","DOI":"10.1016\/j.physa.2016.11.002"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica (New York) 17, 209\u2013223 (1997). https:\/\/doi.org\/10.1007\/BF02523189","DOI":"10.1007\/BF02523189"},{"key":"13_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks (2003). https:\/\/arxiv.org\/abs\/cs\/0310049"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Berry, A., Blair, J., Heggernes, P., Peyton, B.: Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39, 287\u2013298 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1084-3","DOI":"10.1007\/s00453-004-1084-3"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bornd\u00f6rfer, R., Eisenbl\u00e4tter, A., Gr\u00f6tschel, M., Martin, A.: Frequency assignment in cellular phone networks. Ann. Oper. Res. 76, 73\u201393 (1998). https:\/\/doi.org\/10.1023\/a:1018908907763","DOI":"10.1023\/a:1018908907763"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001). https:\/\/doi.org\/10.1080\/0022250X.2001.9990249","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"13_CR9","unstructured":"Campbell, G.: Efficient graph rewriting (2021). https:\/\/arxiv.org\/abs\/1906.05170"},{"key":"13_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition. The MIT Press, 3rd edn. (2009), [Molecular Bond Inference: Sect. 22.2, Transitive Closure: Sect. 25.2]"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"De\u00a0Domenico, M., Lima, A., Mougel, P., Musolesi, M.: The anatomy of a scientific rumor. Sci. Rep. 3(1), October 2013. https:\/\/doi.org\/10.1038\/srep02980","DOI":"10.1038\/srep02980"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Dehof, A.K., Rurainski, A., Bui, Q.B.A., B\u00f6cker, S., Lenhof, H.P., Hildebrandt, A.: Automated bond order assignment as an optimization problem. Bioinformatics 27(5), 619\u2013625 (2011). https:\/\/doi.org\/10.1093\/bioinformatics\/btq718","DOI":"10.1093\/bioinformatics\/btq718"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Delling, D., G\u00f6rke, R., Nikoloski, Z., Gaertler, M., Brandes, U., Wagner, D., Hoefer, M.: On Modularity Clustering. IEEE Trans. Knowl. Data Eng. 20(02), 172\u2013188 (2008). https:\/\/doi.ieeecomputersociety.org\/10.1109\/TKDE.2007.190689","DOI":"10.1109\/TKDE.2007.190689"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Deng, Z., Wang, W., Wang, Z., Liu, X., Song, Y.: Gold: a global and local-aware denoising framework for commonsense knowledge graph noise detection (2023). https:\/\/arxiv.org\/abs\/2310.12011","DOI":"10.18653\/v1\/2023.findings-emnlp.232"},{"key":"13_CR15","unstructured":"Dinella, E., Dai, H., Li, Z., Naik, M., Song, L., Wang, K.: Hoppity: Learning graph transformations to detect and fix bugs in programs. In: International Conference on Learning Representations (2020). https:\/\/openreview.net\/pdf?id=SJeqs6EFvB"},{"key":"13_CR16","unstructured":"Errica, F., Podda, M., Bacciu, D., Micheli, A.: A fair comparison of graph neural networks for graph classification. CoRR abs\/1912.09893 (2019). http:\/\/arxiv.org\/abs\/1912.09893"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Even, G., Naor, J.S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multi-cuts in directed graphs. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920, pp. 14\u201328. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59408-6_38","DOI":"10.1007\/3-540-59408-6_38"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in (2011). https:\/\/arxiv.org\/abs\/1104.2230","DOI":"10.1137\/1.9781611973099.138"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002). https:\/\/doi.org\/10.1073\/pnas.122653799","DOI":"10.1073\/pnas.122653799"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Guo, X., Wang, S., Zhao, L.: Graph neural networks: Graph transformation. In: Wu, L., Cui, P., Pei, J., Zhao, L. (eds.) Graph Neural Networks: Foundations, Frontiers, and Applications, pp. 251\u2013275. Springer, Singapore (2022)","DOI":"10.1007\/978-981-16-6054-2_12"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Heckel, R., Taentzer, G.: Graph Transformation for Software Engineers. Springer (2020)","DOI":"10.1007\/978-3-030-43916-3"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Helaly, A., Sakr, N., Madkour, K., Torunoglu, I.: Unsupervised graph neural network framework for balanced multipatterning in advanced electronic design automation layouts (2025). https:\/\/arxiv.org\/abs\/2511.16374","DOI":"10.1109\/ACCESS.2026.3673032"},{"key":"13_CR23","unstructured":"Henderson, P., Islam, R., Bachman, P., Pineau, J., Precup, D., Meger, D.: Deep reinforcement learning that matters. CoRR abs\/1709.06560 (2017). http:\/\/arxiv.org\/abs\/1709.06560"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitioning. Operat. Res. 39(3), 378\u2013406 (1991). http:\/\/www.jstor.org\/stable\/171393","DOI":"10.1287\/opre.39.3.378"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, pp. 85\u2013103. Springer US, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem (1956). https:\/\/api.semanticscholar.org\/CorpusID:120068278","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Labute, P.: On the perception of molecules from 3d atomic coordinates. J. Chem. Inf. Model. 45(2), 215\u2013221 (2005). https:\/\/doi.org\/10.1021\/ci049915d","DOI":"10.1021\/ci049915d"},{"key":"13_CR28","unstructured":"Leskovec, J., Mcauley, J.: Learning to discover social circles in ego networks. In: Pereira, F., Burges, C., Bottou, L., Weinberger, K. (eds.) Advances in Neural Information Processing Systems. vol.\u00a025. Curran Associates, Inc. (2012). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2012\/file\/7a614fd06c325499f1680b9896beedeb-Paper.pdf"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Li, C., Ueno, M.: An extended depth-first search algorithm for optimal triangulation of bayesian networks. Int. J. Approximate Reasoning 80, 294\u2013312 (2017)","DOI":"10.1016\/j.ijar.2016.09.012"},{"key":"13_CR30","unstructured":"Li, Y., Yu, R., Shahabi, C., Liu, Y.: Diffusion convolutional recurrent neural network: data-driven traffic forecasting (2018). https:\/\/arxiv.org\/abs\/1707.01926"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019\u20131031 (2007). https:\/\/doi.org\/10.1002\/asi.20591","DOI":"10.1002\/asi.20591"},{"key":"13_CR32","unstructured":"Lucic, M., Kurach, K., Michalski, M., Gelly, S., Bousquet, O.: Are gans created equal? a large-scale study (2018). https:\/\/arxiv.org\/abs\/1711.10337"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"WDAG 1996. LNCS, vol. 1151. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61769-8_9","DOI":"10.1007\/3-540-61769-8_9"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D.: Maximum algebraic connectivity augmentation is np-hard. Oper. Res. Lett. 36(6), 677\u2013679 (2008)","DOI":"10.1016\/j.orl.2008.09.001"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Pascual, R., Le Gall, P., Arnould, A., Belhaouari, H.: Topological consistency preservation with graph transformation schemes. Sci. Comput. Program. 214, 102728 (2022)","DOI":"10.1016\/j.scico.2021.102728"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Plump, D.: Reasoning about graph programs (2016)","DOI":"10.4204\/EPTCS.225.6"},{"key":"13_CR37","unstructured":"Rosen, K.H.: Discrete mathematics and its applications. WCB\/McGraw-Hill, 7th edn. (2012). [Symmetric Closure: Sect. 9.3, 9.4]"},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Rossetti, G., Guidotti, R., Miliou, I., Pedreschi, D., Giannotti, F.: A supervised approach for intra-\/inter-community interaction prediction in dynamic social networks. Soc. Netw. Anal. Min. 6(1), 1\u201320 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0397-y","DOI":"10.1007\/s13278-016-0397-y"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Shao, Z., Zhang, Z., Wang, F., Xu, Y.: Pre-training enhanced spatial-temporal graph neural network for multivariate time series forecasting. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1567\u20131577. KDD \u201922. ACM, August 2022. https:\/\/doi.org\/10.1145\/3534678.3539396","DOI":"10.1145\/3534678.3539396"},{"key":"13_CR40","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., G\u00fcnnemann, S.: Pitfalls of graph neural network evaluation. CoRR abs\/1811.05868 (2018). http:\/\/arxiv.org\/abs\/1811.05868"},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","DOI":"10.1137\/0201010"},{"key":"13_CR42","doi-asserted-by":"crossref","unstructured":"Varbella, A., Amara, K., Gjorgiev, B., El-Assady, M., Sansavini, G.: Powergraph: a power grid benchmark dataset for graph neural networks (2024). https:\/\/arxiv.org\/abs\/2402.02827","DOI":"10.52202\/079017-3517"},{"key":"13_CR43","unstructured":"Velickovic, P., Blundell, C.: Neural algorithmic reasoning. CoRR abs\/2105.02761 (2021). https:\/\/arxiv.org\/abs\/2105.02761"},{"key":"13_CR44","doi-asserted-by":"publisher","unstructured":"Yannakakis, M.: Computing the minimum fill-in is np-complete. SIAM J. Algebraic Discrete Methods 2(1), 77\u201379 (1981). https:\/\/doi.org\/10.1137\/0602010","DOI":"10.1137\/0602010"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10(2), 297\u2013309 (1981)","DOI":"10.1137\/0210021"},{"key":"13_CR46","unstructured":"You, J., Ying, R., Ren, X., Hamilton, W.L., Leskovec, J.: Graphrnn: generating realistic graphs with deep auto-regressive models (2018). https:\/\/arxiv.org\/abs\/1802.08773"},{"key":"13_CR47","doi-asserted-by":"publisher","unstructured":"Zhang, J., Tang, J., Li, J., Liu, Y., Xing, C.: Who influenced you? predicting retweet via social influence locality. ACM Trans. Knowl. Discov. Data 9(3), April 2015. https:\/\/doi.org\/10.1145\/2700398","DOI":"10.1145\/2700398"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29730-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:07:12Z","timestamp":1782533232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29730-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032297297","9783032297303"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29730-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"28 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}