{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T02:45:05Z","timestamp":1781664305572,"version":"3.54.5"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T00:00:00Z","timestamp":1709856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T00:00:00Z","timestamp":1709856000000},"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":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-024-01207-y","type":"journal-article","created":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T18:02:14Z","timestamp":1709920934000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A two-phase approach for enumeration of maximal $$(\\Delta , \\gamma )$$-cliques of a temporal network"],"prefix":"10.1007","volume":"14","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bithika","family":"Pal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,8]]},"reference":[{"issue":"1","key":"1207_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu EA (1973) The enumeration of maximal cliques of large graphs. SIAM J Comput 2(1):1\u20136","journal-title":"SIAM J Comput"},{"key":"1207_CR2","doi-asserted-by":"crossref","unstructured":"Al-Naymat G (2008) Enumeration of maximal clique for mining spatial co-location patterns. In: 2008 IEEE\/ACS International conference on computer systems and applications. IEEE, pp 126\u2013133","DOI":"10.1109\/AICCSA.2008.4493526"},{"key":"1207_CR3","doi-asserted-by":"crossref","unstructured":"Banerjee S, Pal B (2019) On the enumeration of maximal ($$\\Delta $$, $$\\gamma $$)-cliques of a temporal network. In: Proceedings of the ACM India joint international conference on data science and management of data, COMAD\/CODS 2019, Kolkata, India, January 3\u20135, 2019, pp 112\u2013120","DOI":"10.1145\/3297001.3297015"},{"key":"1207_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee S, Pal B (2021) A two-phase approach for enumeration of maximal $$(\\delta ,\\gamma )$$-cliques of a temporal network. In: International conference on database and expert systems applications. Springer, pp 346\u2013357","DOI":"10.1007\/978-3-030-86475-0_33"},{"issue":"5","key":"1207_CR5","doi-asserted-by":"publisher","first-page":"cnac027","DOI":"10.1093\/comnet\/cnac027","volume":"10","author":"S Banerjee","year":"2022","unstructured":"Banerjee S, Pal B (2022) An efficient updation approach for enumerating maximal ($$\\delta $$, $$\\gamma $$)-cliques of a temporal network. J Complex Netw 10(5):cnac027","journal-title":"J Complex Netw"},{"key":"1207_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3325859","volume":"24","author":"M Bentert","year":"2019","unstructured":"Bentert M, Himmel AS, Molter H, Morik M, Niedermeier R, Saitenmacher R (2019) Listing all maximal k-Plexes in temporal graphs. J Exp Algorithmics (JEA) 24:1\u201327","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"3","key":"1207_CR7","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1109\/TKDE.2015.2492559","volume":"28","author":"SS Bhowmick","year":"2015","unstructured":"Bhowmick SS, Seah BS (2015) Clustering and summarizing protein-protein interaction networks: a survey. IEEE Trans Knowl Data Eng 28(3):638\u2013658","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"1207_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"3","key":"1207_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TKDE.2019.2891565","volume":"32","author":"J Byun","year":"2019","unstructured":"Byun J, Woo S, Kim D (2019) Chronograph: enabling temporal graph traversals for efficient information diffusion analysis over time. IEEE Trans Knowl Data Eng 32(3):424\u2013437","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1207_CR10","doi-asserted-by":"crossref","unstructured":"Chen Q, Fang C, Wang Z, Suo B, Li Z, Ives ZG (2016) Parallelizing maximal clique enumeration over graph data. In: International conference on database systems for advanced applications. Springer, pp 249\u2013264","DOI":"10.1007\/978-3-319-32049-6_16"},{"key":"1207_CR11","doi-asserted-by":"crossref","unstructured":"Chen Z, Yuan L, Lin X, Qin L, Yang J (2020) Efficient maximal balanced clique enumeration in signed networks. In: Proceedings of the web conference 2020:339\u2013349","DOI":"10.1145\/3366423.3380119"},{"key":"1207_CR12","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Fu AWC, Yu JX, Zhu L (2010) Finding maximal cliques in massive networks by h*-graph. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data. ACM, pp 447\u2013458","DOI":"10.1145\/1807167.1807217"},{"issue":"4","key":"1207_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng J, Ke Y, Fu AWC, Yu JX, Zhu L (2011) Finding maximal cliques in massive networks. ACM Trans Database Syst (TODS) 36(4):21","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"1207_CR14","doi-asserted-by":"crossref","unstructured":"Cheng J, Zhu L, Ke Y, Chu S (2012) Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1240\u20131248","DOI":"10.1145\/2339530.2339724"},{"key":"1207_CR15","doi-asserted-by":"crossref","unstructured":"Dai Q, Li RH, Liao M, Chen H, Wang G (2022) Fast maximal clique enumeration on uncertain graphs: A pivot-based approach. In: Proceedings of the 2022 international conference on management of data, pp 2034\u20132047","DOI":"10.1145\/3514221.3526143"},{"issue":"1","key":"1207_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588931","volume":"1","author":"Q Dai","year":"2023","unstructured":"Dai Q, Li RH, Liao M, Wang G (2023) Maximal defective clique enumeration. Proc ACM Manag Data 1(1):1\u201326","journal-title":"Proc ACM Manag Data"},{"key":"1207_CR17","first-page":"3","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein D, L\u00f6ffler M, Strash D (2013) Listing all maximal cliques in large sparse real-world graphs. J Exp Algorithmics (JEA) 18:3","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"8","key":"1207_CR18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0255067","volume":"16","author":"A Ficara","year":"2021","unstructured":"Ficara A, Cavallaro L, Curreri F, Fiumara G, De Meo P, Bagdasar O, Song W, Liotta A (2021) Criminal networks analysis in missing data scenarios through graph distances. PLoS ONE 16(8):e0255067","journal-title":"PLoS ONE"},{"key":"1207_CR19","volume-title":"Computers and intractability","author":"MR Garey","year":"2002","unstructured":"Garey MR, Johnson DS (2002) Computers and intractability, vol 29. W. H. Freeman, New York"},{"key":"1207_CR20","doi-asserted-by":"crossref","unstructured":"Himmel AS, Molter H, Niedermeier R, Sorge M (2016) Enumerating maximal cliques in temporal graphs. In: Advances in social networks analysis and mining (ASONAM), 2016 IEEE\/ACM international conference on. IEEE, pp 337\u2013344","DOI":"10.1109\/ASONAM.2016.7752255"},{"issue":"1","key":"1207_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"AS Himmel","year":"2017","unstructured":"Himmel AS, Molter H, Niedermeier R, Sorge M (2017) Adapting the Bron\u2013Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc Netw Anal Min 7(1):35","journal-title":"Soc Netw Anal Min"},{"issue":"3","key":"1207_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125","journal-title":"Phys Rep"},{"issue":"4","key":"1207_CR23","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s41019-017-0033-5","volume":"1","author":"B Hou","year":"2016","unstructured":"Hou B, Wang Z, Chen Q, Suo B, Fang C, Li Z, Ives ZG (2016) Efficient maximal clique enumeration over graph data. Data Sci Eng 1(4):219\u2013230","journal-title":"Data Sci Eng"},{"issue":"12","key":"1207_CR24","doi-asserted-by":"publisher","first-page":"i171","DOI":"10.1093\/bioinformatics\/btv227","volume":"31","author":"Y Hulovatyy","year":"2015","unstructured":"Hulovatyy Y, Chen H, Milenkovi\u0107 T (2015) Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31(12):i171\u2013i180","journal-title":"Bioinformatics"},{"issue":"1","key":"1207_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella L, Stehl\u00e9 J, Barrat A, Cattuto C, Pinton JF, Van den Broeck W (2011) What\u2019s in a crowd? Analysis of face-to-face behavioral networks. J Theor Biol 271(1):166\u2013180","journal-title":"J Theor Biol"},{"key":"1207_CR26","doi-asserted-by":"crossref","unstructured":"Kumar S, Spezzano F, Subrahmanian V, Faloutsos C (2016) Edge weight prediction in weighted signed networks. In: Data mining (ICDM), 2016 IEEE 16th international conference on. IEEE, pp 221\u2013230","DOI":"10.1109\/ICDM.2016.0033"},{"key":"1207_CR27","doi-asserted-by":"crossref","unstructured":"Kumar S, Hooi B, Makhija D, Kumar M, Faloutsos C, Subrahmanian V (2018) Rev2: fraudulent user prediction in rating platforms. In: Proceedings of the eleventh ACM international conference on web search and data mining. ACM, pp 333\u2013341","DOI":"10.1145\/3159652.3159729"},{"key":"1207_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2018.10.014","volume":"770","author":"G Manoussakis","year":"2019","unstructured":"Manoussakis G (2019) A new decomposition technique for maximal clique enumeration for sparse graphs. Theor Comput Sci 770:25\u201333","journal-title":"Theor Comput Sci"},{"key":"1207_CR29","doi-asserted-by":"crossref","unstructured":"Manoussakis G (2023) Efficient maximal cliques enumeration in weakly closed graphs. arXiv preprint arXiv:2303.02390","DOI":"10.2139\/ssrn.5066441"},{"key":"1207_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-5287-3","volume-title":"Temporal network epidemiology","author":"N Masuda","year":"2017","unstructured":"Masuda N, Holme P (2017) Temporal network epidemiology. Springer, Berlin"},{"key":"1207_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2021.03.005","volume":"120","author":"GB Mertzios","year":"2021","unstructured":"Mertzios GB, Molter H, Zamaraev V (2021) Sliding window temporal graph coloring. J Comput Syst Sci 120:97\u2013115","journal-title":"J Comput Syst Sci"},{"key":"1207_CR32","doi-asserted-by":"crossref","unstructured":"Molter H, Niedermeier R, Renken M (2019) Enumerating isolated cliques in temporal networks. In: International conference on complex networks and their applications. Springer, pp 519\u2013531","DOI":"10.1007\/978-3-030-36683-4_42"},{"issue":"3","key":"1207_CR33","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TKDE.2016.2527643","volume":"29","author":"AP Mukherjee","year":"2016","unstructured":"Mukherjee AP, Xu P, Tirthapura S (2016) Enumeration of maximal cliques from an uncertain graph. IEEE Trans Knowl Data Eng 29(3):543\u2013555","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"1207_CR34","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"P Panzarasa","year":"2009","unstructured":"Panzarasa P, Opsahl T, Carley KM (2009) Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community. J Am Soc Inf Sci 60(5):911\u2013932","journal-title":"J Am Soc Inf Sci"},{"key":"1207_CR35","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TKDE.2020.3028025","volume":"34","author":"H Qin","year":"2020","unstructured":"Qin H, Li R, Yuan Y, Wang G, Yang W, Qin L (2020) Periodic communities mining in temporal networks: concepts and algorithms. IEEE Trans Knowl Data Eng 34:3927\u20133945","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1207_CR36","doi-asserted-by":"crossref","unstructured":"Rossi RA, Gleich DF, Gebremedhin AH, Patwary MMA (2014) Fast maximum clique algorithms for large graphs. In: Proceedings of the 23rd international conference on World Wide Web. ACM, pp 365\u2013366","DOI":"10.1145\/2567948.2577283"},{"issue":"5","key":"1207_CR37","doi-asserted-by":"publisher","first-page":"C589","DOI":"10.1137\/14100018X","volume":"37","author":"RA Rossi","year":"2015","unstructured":"Rossi RA, Gleich DF, Gebremedhin AH (2015) Parallel maximum clique algorithms with applications to network analysis. SIAM J Sci Comput 37(5):C589\u2013C616","journal-title":"SIAM J Sci Comput"},{"key":"1207_CR38","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A (2019) Mining temporal networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data Mining, pp 3225\u20133226","DOI":"10.1145\/3292500.3332295"},{"issue":"4","key":"1207_CR39","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt MC, Samatova NF, Thomas K, Park BH (2009) A scalable, parallel algorithm for maximal clique enumeration. J Parallel Distrib Comput 69(4):417\u2013428","journal-title":"J Parallel Distrib Comput"},{"key":"1207_CR40","doi-asserted-by":"crossref","unstructured":"Viard J, Latapy M, Magnien C (2015) 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. ACM, pp 1517\u20131522","DOI":"10.1145\/2808797.2809291"},{"key":"1207_CR41","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard T, Latapy M, Magnien C (2016) Computing maximal cliques in link streams. Theor Comput Sci 609:245\u2013252","journal-title":"Theor Comput Sci"},{"key":"1207_CR42","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ipl.2018.01.006","volume":"133","author":"T Viard","year":"2018","unstructured":"Viard T, Magnien C, Latapy M (2018) Enumerating maximal cliques in link streams with durations. Inf Process Lett 133:44\u201348","journal-title":"Inf Process Lett"},{"key":"1207_CR43","doi-asserted-by":"crossref","unstructured":"Xiang J, Guo C, Aboulnaga A (2013) Scalable maximum clique computation using mapreduce. In: 2013 IEEE 29th International conference on data engineering (ICDE). IEEE, pp 74\u201385","DOI":"10.1109\/ICDE.2013.6544815"},{"key":"1207_CR44","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang S (2010) Finding top-k maximal cliques in an uncertain graph. In: 2010 IEEE 26th International conference on data engineering (ICDE 2010). IEEE, pp 649\u2013652","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"1207_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106181","volume":"174","author":"P Zschoche","year":"2022","unstructured":"Zschoche P (2022) A faster parameterized algorithm for temporal matching. Inf Process Lett 174:106181","journal-title":"Inf Process Lett"},{"key":"1207_CR46","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche P, Fluschnik T, Molter H, Niedermeier R (2020) The complexity of finding small separators in temporal graphs. J Comput Syst Sci 107:72\u201392","journal-title":"J Comput Syst Sci"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01207-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T14:17:16Z","timestamp":1740493036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01207-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,8]]},"references-count":46,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1207"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01207-y","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,8]]},"assertion":[{"value":"27 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"54"}}