{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:06Z","timestamp":1742911986064,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031211263"},{"type":"electronic","value":"9783031211270"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-21127-0_34","type":"book-chapter","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T19:38:43Z","timestamp":1672774723000},"page":"415-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Geometric Deep Learning Graph Pruning to\u00a0Speed-Up the\u00a0Run-Time of\u00a0Maximum Clique Enumerarion Algorithms"],"prefix":"10.1007","author":[{"given":"A.","family":"Arciprete","sequence":"first","affiliation":[]},{"given":"V.","family":"Carchiolo","sequence":"additional","affiliation":[]},{"given":"D.","family":"Chiavetta","sequence":"additional","affiliation":[]},{"given":"M.","family":"Grassia","sequence":"additional","affiliation":[]},{"given":"M.","family":"Malgeri","sequence":"additional","affiliation":[]},{"given":"G.","family":"Mangioni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"issue":"9","key":"34_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973). https:\/\/doi.org\/10.1145\/362342.362367","journal-title":"Commun. ACM"},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng, J., Ke, Y., Fu, A.W.C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. ACM Trans. Database Syst. (TODS) 36(4), 1\u201334 (2011)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Costa, L.D.F., Oliveira, O.N., Travieso, G., Rodrigues, F.A., Villas\u00a0Boas, P.R., Antiqueira, L., Viana, M.P., Correa\u00a0Rocha, L.E.: Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv. Phys. 60(3), 329\u2013412 (2011)","DOI":"10.1080\/00018732.2011.572452"},{"key":"34_CR4","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. InterJ. Complex Syst. 1695 (2006). https:\/\/igraph.org"},{"issue":"6","key":"34_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1038\/s42256-020-0177-2","volume":"2","author":"C Fan","year":"2020","unstructured":"Fan, C., Zeng, L., Sun, Y., Liu, Y.Y.: Finding key players in complex networks through deep reinforcement learning. Nature Mach. Intel. 2(6), 317\u2013324 (2020). https:\/\/doi.org\/10.1038\/s42256-020-0177-2","journal-title":"Nature Mach. Intel."},{"key":"34_CR6","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with PyTorch Geometric. In: ICLR Workshop on Representation Learning on Graphs and Manifolds (2019)"},{"issue":"1","key":"34_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-12-1","volume":"12","author":"D Fukagawa","year":"2011","unstructured":"Fukagawa, D., Tamura, T., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. BMC Bioinform. 12(1), 1\u20139 (2011)","journal-title":"BMC Bioinform."},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"5190","DOI":"10.1038\/s41467-021-25485-8","volume":"12","author":"M Grassia","year":"2021","unstructured":"Grassia, M., De Domenico, M., Mangioni, G.: Machine learning dismantling and early-warning signals of disintegration in complex systems. Nature Commun. 12(1), 5190 (2021). https:\/\/doi.org\/10.1038\/s41467-021-25485-8","journal-title":"Nature Commun."},{"key":"34_CR9","unstructured":"Grassia, M., Lauri, J., Dutta, S., Ajwani, D.: Learning multi-stage sparsification for maximum clique enumeration (2019)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Grassia, M., Mangioni, G.: wsGAT: weighted and signed graph attention networks for link prediction. In: International Conference on Complex Networks and Their Applications, pp. 369\u2013375. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-93409-5_31","DOI":"10.1007\/978-3-030-93409-5_31"},{"key":"34_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115915","volume":"187","author":"Y Jin","year":"2022","unstructured":"Jin, Y., Xiong, B., He, K., Zhou, Y., Zhou, Y.: On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187, 115915 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00991836","volume":"5","author":"H Johnston","year":"1976","unstructured":"Johnston, H.: Cliques of a graph-variations on the Bron-kerbosch algorithm. Int. J. Comput. Inf. Sci. 5(3), 209\u2013238 (1976)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"12","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1093\/bioinformatics\/17.12.1198","volume":"17","author":"F Kose","year":"2001","unstructured":"Kose, F., Weckwerth, W., Linke, T., Fiehn, O.: Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics 17(12), 1198\u20131208 (2001)","journal-title":"Bioinformatics"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Lauri, J., Dutta, S.: Fine-grained search space classification for hard enumeration variants of subset problems. Proc. AAAI Conf. Artif. Intel. 33(01), 2314\u20132321 (2019). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/4070","DOI":"10.1609\/aaai.v33i01.33012314"},{"key":"34_CR15","unstructured":"Lauri, J., Dutta, S., Grassia, M., Ajwani, D.: Learning fine-grained search space pruning and heuristics for combinatorial optimization (2020)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., Zhou, R., Chen, L., Zhang, Y., Liu, C., He, Q., Yang, Y.: Finding a summary for all maximal cliques. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1344\u20131355. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00120"},{"issue":"15","key":"34_CR17","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1093\/bioinformatics\/btp311","volume":"25","author":"G Liu","year":"2009","unstructured":"Liu, G., Wong, L., Chua, H.N.: Complex discovery from weighted PPI networks. Bioinformatics 25(15), 1891\u20131897 (2009). https:\/\/doi.org\/10.1093\/bioinformatics\/btp311","journal-title":"Bioinformatics"},{"issue":"10","key":"34_CR18","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1089\/cmb.2012.0133","volume":"19","author":"T Mori","year":"2012","unstructured":"Mori, T., Tamura, T., Fukagawa, D., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method using dynamic programming for computing edit distance between unordered trees. J. Comput. Biol. 19(10), 1089\u20131104 (2012)","journal-title":"J. Comput. Biol."},{"issue":"1\u20133","key":"34_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PR \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1\u20133), 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Global Opt. 4(3), 301\u2013328 (1994)","journal-title":"J. Global Opt."},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Pattabiraman, B., Patwary, M.M.A., Gebremedhin, A.H., Liao, W.K., Choudhary, A.: Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection. Internet Math. 11(4\u20135), 421\u2013448 (2015)","DOI":"10.1080\/15427951.2014.986778"},{"key":"34_CR22","unstructured":"Peixoto, T.P.: The graph-tool python library. figshare (2014), http:\/\/figshare.com\/articles\/graph_tool\/1164194"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"34_CR24","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.), Advances in Neural Information Processing Systems, vol.\u00a030. Curran Associates, Inc. (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/file\/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf"},{"key":"34_CR25","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. STAT 1050, 20 (2017)"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Qin, L., Yang, J.: Efficient maximal spatial clique enumeration. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 878\u2013889 (2019)","DOI":"10.1109\/ICDE.2019.00083"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21127-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T19:44:55Z","timestamp":1672775095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21127-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211263","9783031211270"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21127-0_34","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}