{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T05:45:15Z","timestamp":1763963115749,"version":"3.45.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031706288"},{"type":"electronic","value":"9783031706264"}],"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-70626-4_6","type":"book-chapter","created":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T03:01:52Z","timestamp":1725159712000},"page":"79-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Recursive Approach for\u00a0Maximal ($$\\varDelta , \\gamma $$)-Clique Enumeration in\u00a0Temporal Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2177-9776","authenticated-orcid":false,"given":"Bithika","family":"Pal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973). https:\/\/doi.org\/10.1137\/0202001","DOI":"10.1137\/0202001"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Banerjee, S., Pal, B.: On the enumeration of maximal ($$\\varDelta $$, $$\\gamma $$)-cliques of a temporal network. In: Krishnapuram, R., Singla, P. (eds.) Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, COMAD\/CODS 2019, Kolkata, India, 3\u20135 January 2019, pp. 112\u2013120. ACM (2019). https:\/\/doi.org\/10.1145\/3297001.3297015","DOI":"10.1145\/3297001.3297015"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-030-86475-0_33","volume-title":"Database and Expert Systems Applications","author":"S Banerjee","year":"2021","unstructured":"Banerjee, S., Pal, B.: A two-phase approach for enumeration of maximal $$(\\varDelta , \\gamma )$$-cliques of a temporal network. In: Strauss, C., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2021. LNCS, vol. 12924, pp. 346\u2013357. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86475-0_33"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Banerjee, S., Pal, B.: A two-phase approach for enumeration of maximal ($$\\varDelta $$, $$\\gamma $$ )-cliques of a temporal network. Soc. Netw. Anal. Min. 14(1), 54 (2023). https:\/\/doi.org\/10.1007\/S13278-024-01207-Y","DOI":"10.1007\/S13278-024-01207-Y"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0415-0","volume":"6","author":"GA Barnett","year":"2016","unstructured":"Barnett, G.A., Jiang, K.: Resilience of the world wide web: a longitudinal two-mode network analysis. Soc. Netw. Anal. Min. 6, 1\u201315 (2016)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"9","key":"6_CR6","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)","journal-title":"Commun. ACM"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.14778\/3565816.3565817","volume":"16","author":"L Chang","year":"2022","unstructured":"Chang, L., Xu, M., Strash, D.: Efficient maximum k-plex computation over large sparse graphs. Proc. VLDB Endow. 16(2), 127\u2013139 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Fu, A.W.C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 447\u2013458 (2010)","DOI":"10.1145\/1807167.1807217"},{"issue":"4","key":"6_CR9","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":"6_CR10","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. J. Experimental Algorithmics (JEA) 18, 3\u20131 (2013)","DOI":"10.1145\/2543629"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dam.2014.04.016","volume":"174","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Rafiey, A.: Finding clubs in graph classes. Discret. Appl. Math. 174, 57\u201365 (2014)","journal-title":"Discret. Appl. Math."},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113885","volume":"961","author":"D Hermelin","year":"2023","unstructured":"Hermelin, D., Itzhaki, Y., Molter, H., Niedermeier, R.: Temporal interval cliques and independent sets. Theor. Comput. Sci. 961, 113885 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"AS Himmel","year":"2017","unstructured":"Himmel, A.S., Molter, H., Niedermeier, R., Sorge, M.: Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7, 1\u201316 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s41019-017-0033-5","volume":"1","author":"B Hou","year":"2016","unstructured":"Hou, B., et al.: Efficient maximal clique enumeration over graph data. Data Sci. Eng. 1, 219\u2013230 (2016)","journal-title":"Data Sci. Eng."},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s11590-023-01975-0","volume":"17","author":"Y Lu","year":"2023","unstructured":"Lu, Y., Miao, Z., Sahraeian, P., Balasundaram, B.: On atomic cliques in temporal graphs. Optim. Lett. 17(4), 813\u2013828 (2023)","journal-title":"Optim. Lett."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"FD Malliaros","year":"2020","unstructured":"Malliaros, F.D., Giatsidis, C., Papadopoulos, A.N., Vazirgiannis, M.: The core decomposition of networks: theory, algorithms and applications. VLDB J. 29(1), 61\u201392 (2020)","journal-title":"VLDB J."},{"issue":"7","key":"6_CR17","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/2483852.2483871","volume":"56","author":"M Marathe","year":"2013","unstructured":"Marathe, M., Vullikanti, A.K.S.: Computational epidemiology. Commun. ACM 56(7), 88\u201396 (2013)","journal-title":"Commun. ACM"},{"issue":"9","key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea, R., Fournet, J., Barrat, A.: Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9), e0136497 (2015)","journal-title":"PLoS ONE"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Milano, M., Cannataro, M.: Network models in bioinformatics: modeling and analysis for complex diseases (2023)","DOI":"10.1093\/bib\/bbad016"},{"key":"6_CR20","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-36683-4_42","volume-title":"Complex Networks and Their Applications VIII","author":"H Molter","year":"2020","unstructured":"Molter, H., Niedermeier, R., Renken, M.: Enumerating isolated cliques in temporal networks. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 882, pp. 519\u2013531. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36683-4_42"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Qin, H., Li, R.H., Wang, G., Qin, L., Cheng, Y., Yuan, Y.: Mining periodic cliques in temporal networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1130\u20131141. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00104"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.A.: Fast maximum clique algorithms for large graphs. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 365\u2013366 (2014)","DOI":"10.1145\/2567948.2577283"},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3446637","volume":"15","author":"SV Sanei-Mehri","year":"2021","unstructured":"Sanei-Mehri, S.V., Das, A., Hashemi, H., Tirthapura, S.: Mining largest maximal quasi-cliques. ACM Trans. Knowl. Discov. Data (TKDD) 15(5), 1\u201321 (2021)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Stehl\u00e9, J., et al.: High-resolution measurements of face-to-face contact patterns in a primary school. PLOS ONE 6(8), e23176 (2011). https:\/\/doi.org\/10.1371\/journal.pone.0023176","DOI":"10.1371\/journal.pone.0023176"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Viard, J., Latapy, M., Magnien, C.: Revealing contact patterns among high-school students using maximal cliques in link streams. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, pp. 1517\u20131522 (2015)","DOI":"10.1145\/2808797.2809291"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Wang, J., Zeng, Z., Zhou, L.: Clan: an algorithm for mining closed cliques from large dense graph databases. In: 22nd International Conference on Data Engineering (ICDE 2006), p. 73. IEEE (2006)","DOI":"10.1109\/ICDE.2006.34"},{"issue":"5","key":"6_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"DR Wood","year":"1997","unstructured":"Wood, D.R.: An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. 21(5), 211\u2013217 (1997)","journal-title":"Oper. Res. Lett."},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Xiang, J., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using mapreduce. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 74\u201385. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544815"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Yang, S., Keller, F.B., Zheng, L.: Social Network Analysis: Methods and Examples. Sage Publications (2016)","DOI":"10.4135\/9781071802847"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, K., Fletcher, G., Yakovets, N., Papapetrou, O., Wu, Y.: Scalable temporal clique enumeration. In: Proceedings of the 16th International Symposium on Spatial and Temporal Databases, pp. 120\u2013129 (2019)","DOI":"10.1145\/3340964.3340987"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70626-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T05:43:37Z","timestamp":1763963017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70626-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031706288","9783031706264"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70626-4_6","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":"1 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bayonne","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.sigappfr.org\/adbis2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}