{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:27:04Z","timestamp":1767680824857,"version":"3.48.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T00:00:00Z","timestamp":1767657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T00:00:00Z","timestamp":1767657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-025-01539-3","type":"journal-article","created":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:23:12Z","timestamp":1767680592000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast maximal clique enumeration in weighted temporal networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Hanjo D.","family":"Boekhout","sequence":"first","affiliation":[]},{"given":"Frank W.","family":"Takes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,6]]},"reference":[{"issue":"1","key":"1539_CR1","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 J, Van den Broeck W (2011) What\u2019s in a crowd? analysis of face-to-face behavioral networks. J Theor Biol 271(1):166\u2013180. https:\/\/doi.org\/10.1016\/j.jtbi.2010.11.033","journal-title":"J Theor Biol"},{"issue":"5","key":"1539_CR2","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 Inform Sci Technol 60(5):911\u2013932","journal-title":"J Am Soc Inform Sci Technol"},{"key":"1539_CR3","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 37\u201342","DOI":"10.1145\/1592665.1592675"},{"key":"1539_CR4","doi-asserted-by":"crossref","unstructured":"Kumar S, Hamilton WL, Leskovec J, Jurafsky D (2018) Community interaction and conflict on the web. In: Proceedings of the 2018 World Wide Web Conference on World Wide Web, pp. 933\u2013943. International World Wide Web Conferences Steering Committee","DOI":"10.1145\/3178876.3186141"},{"key":"1539_CR5","unstructured":"Garcia RL et al (2019) Enumerating cliques and their relaxations: sequential and parallel algorithms. PhD-thesis. Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\""},{"key":"1539_CR6","doi-asserted-by":"crossref","unstructured":"Banerjee S, Pal B (2024) A two-phase approach for enumeration of maximal ($$\\delta$$, $$\\gamma$$)-cliques of a temporal network. Soc Netw Anal Min 14(1):54","DOI":"10.1007\/s13278-024-01207-y"},{"issue":"9","key":"1539_CR7","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":"1","key":"1539_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret Comput Sci 363(1):28\u201342","journal-title":"Theoret Comput Sci"},{"key":"1539_CR9","doi-asserted-by":"crossref","unstructured":"Eppstein D, L\u00f6ffler M, Strash D (2010) Listing all maximal cliques in sparse graphs in near-optimal time. In: Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I 21, pp. 403\u2013414. Springer","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"1539_CR10","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, pp. 1240\u20131248","DOI":"10.1145\/2339530.2339724"},{"issue":"4","key":"1539_CR11","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 B-H (2009) A scalable, parallel algorithm for maximal clique enumeration. J Parallel Distrib Comput 69(4):417\u2013428","journal-title":"J Parallel Distrib Comput"},{"key":"1539_CR12","doi-asserted-by":"crossref","unstructured":"Wu B, Yang S, Zhao H, Wang B (2009) A distributed algorithm to enumerate all maximal cliques in mapreduce. In: 2009 Fourth International Conference on Frontier of Computer Science and Technology, pp. 45\u201351. IEEE","DOI":"10.1109\/FCST.2009.30"},{"key":"1539_CR13","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:219\u2013230","journal-title":"Data Sci Eng"},{"key":"1539_CR14","doi-asserted-by":"crossref","unstructured":"Das A, Sanei-Mehri S-V, Tirthapura S (2018) Shared-memory parallel maximal clique enumeration. In: 2018 IEEE 25th International Conference on High Performance Computing (HiPC), pp. 62\u201371. IEEE","DOI":"10.1109\/HiPC.2018.00016"},{"issue":"12","key":"1539_CR15","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 (2001) Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics 17(12):1198\u20131208","journal-title":"Bioinformatics"},{"key":"1539_CR16","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. Theoret Comput Sci 770:25\u201333","journal-title":"Theoret Comput Sci"},{"key":"1539_CR17","doi-asserted-by":"crossref","unstructured":"Eblen JD, Phillips CA, Rogers GL, Langston MA (2012) The maximum clique enumeration problem: algorithms, applications, and implementations. In: BMC Bioinformatics, vol. 13, pp. 1\u201311. Springer","DOI":"10.1186\/1471-2105-13-S10-S5"},{"issue":"4","key":"1539_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1597036.1597044","volume":"5","author":"H Ito","year":"2009","unstructured":"Ito H, Iwama K (2009) Enumeration of isolated cliques and pseudo-cliques. ACM Trans Algorithms (TALG) 5(4):1\u201321","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"1539_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno T (2010) An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56:3\u201316","journal-title":"Algorithmica"},{"issue":"1","key":"1539_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588931","volume":"1","author":"Q Dai","year":"2023","unstructured":"Dai Q, Li R-H, Liao M, Wang G (2023) Maximal defective clique enumeration. Proc ACM Management Data 1(1):1\u201326","journal-title":"Proc ACM Management Data"},{"key":"1539_CR21","doi-asserted-by":"crossref","unstructured":"Conte A, Firmani D, Mordente C, Patrignani M, Torlone R (2017) Fast enumeration of large k-plexes. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 115\u2013124","DOI":"10.1145\/3097983.3098031"},{"key":"1539_CR22","doi-asserted-by":"crossref","unstructured":"Zhang C, Zhang Y, Zhang W, Qin L, Yang J (2019) Efficient maximal spatial clique enumeration. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 878\u2013889. IEEE","DOI":"10.1109\/ICDE.2019.00083"},{"issue":"3","key":"1539_CR23","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":"12","key":"1539_CR24","doi-asserted-by":"publisher","first-page":"12634","DOI":"10.1109\/TKDE.2023.3272110","volume":"35","author":"J Wang","year":"2023","unstructured":"Wang J, Yang J, Ma Z, Zhang C, Yang S, Zhang W (2023) Efficient maximal biclique enumeration on large uncertain bipartite graphs. IEEE Trans Knowl Data Eng 35(12):12634\u201312648","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1539_CR25","doi-asserted-by":"crossref","unstructured":"Ma Z, Wang L, Yang J, Zhou X, Li K, Gao C (2025) Maximal $$\\eta$$-clique maintenance over uncertain graph streams. Information Sciences, 122318","DOI":"10.1016\/j.ins.2025.122318"},{"key":"1539_CR26","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, pp. 339\u2013349","DOI":"10.1145\/3366423.3380119"},{"issue":"9","key":"1539_CR27","doi-asserted-by":"publisher","first-page":"4618","DOI":"10.1109\/TKDE.2024.3373654","volume":"36","author":"J Wang","year":"2024","unstructured":"Wang J, Yang J, Gu Z, Ouyang D, Tian Z, Lin X (2024) Efficient maximal biclique enumeration on large signed bipartite graphs. IEEE Trans Knowl Data Eng 36(9):4618\u20134631","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1539_CR28","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, pp. 1517\u20131522","DOI":"10.1145\/2808797.2809291"},{"key":"1539_CR29","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. Theoret Comput Sci 609:245\u2013252","journal-title":"Theoret Comput Sci"},{"key":"1539_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"A-S Himmel","year":"2017","unstructured":"Himmel A-S, Molter H, Niedermeier R, Sorge M (2017) Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc Netw Anal Min 7:1\u201316","journal-title":"Soc Netw Anal Min"},{"key":"1539_CR31","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":"1539_CR32","doi-asserted-by":"crossref","unstructured":"Zhu K, Fletcher G, Yakovets N, Papapetrou O, Wu Y (2019) Scalable temporal clique enumeration. In: Proceedings of the 16th International Symposium on Spatial and Temporal Databases, pp. 120\u2013129","DOI":"10.1145\/3340964.3340987"},{"key":"1539_CR33","doi-asserted-by":"crossref","unstructured":"Qin H, Li R-H, Wang G, Qin L, Cheng Y, Yuan Y (2019) Mining periodic cliques in temporal networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1130\u20131141. IEEE","DOI":"10.1109\/ICDE.2019.00104"},{"key":"1539_CR34","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, pp. 112\u2013120","DOI":"10.1145\/3297001.3297015"},{"key":"1539_CR35","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: Database and Expert Systems Applications: 32nd International Conference, DEXA 2021, Virtual Event, September 27\u201330, 2021, Proceedings, Part II 32, pp. 346\u2013357. Springer","DOI":"10.1007\/978-3-030-86475-0_33"},{"key":"1539_CR36","doi-asserted-by":"crossref","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):027","DOI":"10.1093\/comnet\/cnac027"},{"key":"1539_CR37","unstructured":"Boekhout HD, Heemskerk EM, Pisani N, Takes FW (2025) Freshness, persistence and success of scientific teams. arXiv preprint arXiv:2507.12255"},{"key":"1539_CR38","unstructured":"The SocioPatterns data repository of physical proximity and face-to-face contacts of individuals in numerous real-world environments. http:\/\/www.sociopatterns.org. Accessed: 2024-06-10"},{"key":"1539_CR39","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. Accessed: 2024-06-10"},{"key":"1539_CR40","doi-asserted-by":"crossref","unstructured":"Kumar S, Spezzano F, Subrahmanian V, Faloutsos C (2016) Edge weight prediction in weighted signed networks. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 221\u2013230. IEEE","DOI":"10.1109\/ICDM.2016.0033"},{"key":"1539_CR41","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, pp. 333\u2013341","DOI":"10.1145\/3159652.3159729"},{"key":"1539_CR42","doi-asserted-by":"publisher","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web. WWW \u201913 Companion, pp. 1343\u20131350. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/2487788.2488173 . Accessed: 2024-06-10","DOI":"10.1145\/2487788.2488173"},{"key":"1539_CR43","doi-asserted-by":"crossref","unstructured":"Klimt B, Yang Y (2004) The enron corpus: A new dataset for email classification research. In: European Conference on Machine Learning, pp. 217\u2013226. Springer","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"1539_CR44","doi-asserted-by":"crossref","unstructured":"Konstas I, Stathopoulos V, Jose JM (2009) On social networks and collaborative recommendation. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 195\u2013202. ACM","DOI":"10.1145\/1571941.1571977"},{"key":"1539_CR45","doi-asserted-by":"crossref","unstructured":"Renyi E (1959) On random graph Publicationes Mathematicate 6:290\u2013297","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"1539_CR46","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439), 509\u2013512","DOI":"10.1126\/science.286.5439.509"},{"issue":"7039","key":"1539_CR47","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"A-L Barabasi","year":"2005","unstructured":"Barabasi A-L (2005) The origin of bursts and heavy tails in human dynamics. Nature 435(7039):207\u2013211","journal-title":"Nature"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01539-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-025-01539-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01539-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:23:17Z","timestamp":1767680597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-025-01539-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,6]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["1539"],"URL":"https:\/\/doi.org\/10.1007\/s13278-025-01539-3","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,6]]},"assertion":[{"value":"3 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The (modified) implementations of all algorithms used in the experiments of this study can be found at\n                      \n                      .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"10"}}