{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T15:59:34Z","timestamp":1762531174081,"version":"build-2065373602"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Innovation Capability Improvement Plan Project of Hebei Province","award":["22567626H"],"award-info":[{"award-number":["22567626H"]}]},{"name":"Central Leading Local Science and Technology Development Project of Hebei Province","award":["246Z0307G"],"award-info":[{"award-number":["246Z0307G"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10115-025-02545-9","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T16:18:27Z","timestamp":1754324307000},"page":"10833-10861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximal $$\\Delta $$-biclique enumeration in temporal bipartite graphs"],"prefix":"10.1007","volume":"67","author":[{"given":"Liang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanglin","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,4]]},"reference":[{"issue":"3","key":"2545_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0378-8733(96)00301-2","volume":"19","author":"SP Borgatti","year":"1997","unstructured":"Borgatti SP, Everett MG (1997) Network analysis of 2-mode data. Soc Netw 19(3):243\u2013269. https:\/\/doi.org\/10.1016\/S0378-8733(96)00301-2","journal-title":"Soc Netw"},{"key":"2545_CR2","doi-asserted-by":"publisher","unstructured":"Wang H, Zhou C, Wu J, Dang W, Zhu X, Wang J (2018) Deep structure learning for fraud detection. In: IEEE international conference on data mining, ICDM 2018, Singapore, November 17-20, 2018. IEEE Computer Society, pp 567\u2013576. https:\/\/doi.org\/10.1109\/ICDM.2018.00072","DOI":"10.1109\/ICDM.2018.00072"},{"key":"2545_CR3","doi-asserted-by":"publisher","unstructured":"Deng H, Lyu MR, King I (2009) A generalized co-HITS algorithm and its application to bipartite graphs. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201909. Association for Computing Machinery, New York, pp 239\u2013248. https:\/\/doi.org\/10.1145\/1557019.1557051","DOI":"10.1145\/1557019.1557051"},{"key":"2545_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.socnet.2015.04.001","volume":"42","author":"M Cerin\u0161ek","year":"2015","unstructured":"Cerin\u0161ek M, Batagelj V (2015) Generalized two-mode cores. Soc Netw 42:80\u201387. https:\/\/doi.org\/10.1016\/j.socnet.2015.04.001","journal-title":"Soc Netw"},{"key":"2545_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1186\/1471-2105-15-110","volume":"15","author":"Y Zhang","year":"2014","unstructured":"Zhang Y, Phillips CA, Rogers GL, Baker EJ, Chesler EJ, Langston MA (2014) On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinform 15:110. https:\/\/doi.org\/10.1186\/1471-2105-15-110","journal-title":"BMC Bioinform"},{"issue":"4","key":"2545_CR6","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/COMNET\/CNX001","volume":"5","author":"S Aksoy","year":"2017","unstructured":"Aksoy S, Kolda TG, Pinar A (2017) Measuring and modeling bipartite graphs with community structure. J Complex Netw 5(4):581\u2013603. https:\/\/doi.org\/10.1093\/COMNET\/CNX001","journal-title":"J Complex Netw"},{"key":"2545_CR7","doi-asserted-by":"publisher","unstructured":"Abidi A, Zhou R, Chen L, Liu C (2020) Pivot-based Maximal Biclique Enumeration. In: Bessiere C (eds) Proceedings of the twenty-ninth international joint conference on artificial intelligence, IJCAI 2020. ijcai.org; pp 3558\u20133564. https:\/\/doi.org\/10.24963\/ijcai.2020\/492","DOI":"10.24963\/ijcai.2020\/492"},{"issue":"9","key":"2545_CR8","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.14778\/3397230.3397234","volume":"13","author":"B Lyu","year":"2020","unstructured":"Lyu B, Qin L, Lin X, Zhang Y, Qian Z, Zhou J (2020) Maximum biclique search at billion scale. Proc VLDB Endow 13(9):1359\u20131372. https:\/\/doi.org\/10.14778\/3397230.3397234","journal-title":"Proc VLDB Endow"},{"issue":"8","key":"2545_CR9","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.14778\/3529337.3529341","volume":"15","author":"L Chen","year":"2022","unstructured":"Chen L, Liu C, Zhou R, Xu J, Li J (2022) Efficient maximal biclique enumeration for large sparse bipartite graphs. Proc VLDB Endow 15(8):1559\u20131571. https:\/\/doi.org\/10.14778\/3529337.3529341","journal-title":"Proc VLDB Endow"},{"key":"2545_CR10","doi-asserted-by":"publisher","unstructured":"Muhammad AS, Damaschke P, Mogren O (2016) Summarizing online user reviews using bicliques. In: Freivalds RM, Engels G, Catania B (eds) SOFSEM 2016: theory and practice of computer science\u201442nd international conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings. vol. 9587 of Lecture Notes in Computer Science. Springer, pp 569\u2013579. https:\/\/doi.org\/10.1007\/978-3-662-49192-8_46","DOI":"10.1007\/978-3-662-49192-8_46"},{"issue":"S\u201318","key":"2545_CR11","doi-asserted-by":"publisher","first-page":"A10","DOI":"10.1186\/1471-2105-13-S18-A10","volume":"13","author":"O Voggenreiter","year":"2012","unstructured":"Voggenreiter O, Bleuler S, Gruissem W (2012) Exact biclustering algorithm for the analysis of large gene expression data sets. BMC Bioinform 13(S\u201318):A10. https:\/\/doi.org\/10.1186\/1471-2105-13-S18-A10","journal-title":"BMC Bioinform"},{"issue":"4","key":"2545_CR12","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/TITB.2007.897575","volume":"11","author":"S Yoon","year":"2007","unstructured":"Yoon S, Benini L, Micheli GD (2007) Co-clustering: a versatile tool for data analysis in biomedical informatics. IEEE Trans Inf Technol Biomed 11(4):493\u2013494. https:\/\/doi.org\/10.1109\/TITB.2007.897575","journal-title":"IEEE Trans Inf Technol Biomed"},{"key":"2545_CR13","doi-asserted-by":"publisher","unstructured":"Chen Z, Zhao Y, Yuan L, Lin X, Wang K (2023) Index-based biclique percolation communities search on bipartite graphs. In: 39th IEEE international conference on data engineering, ICDE 2023, Anaheim, CA, USA, April 3-7, 2023. IEEE, pp 2699\u20132712. https:\/\/doi.org\/10.1109\/ICDE55515.2023.00207","DOI":"10.1109\/ICDE55515.2023.00207"},{"key":"2545_CR14","doi-asserted-by":"publisher","unstructured":"Bera D, Esposito F, Pendyala M (2018) Maximal labelled-clique and click-biclique problems for networked community detection. In: IEEE global communications conference, GLOBECOM 2018, Abu Dhabi, United Arab Emirates, December 9-13, 2018. IEEE, pp 1\u20136. https:\/\/doi.org\/10.1109\/GLOCOM.2018.8647563","DOI":"10.1109\/GLOCOM.2018.8647563"},{"key":"2545_CR15","doi-asserted-by":"publisher","unstructured":"Du N, Wang B, Wu B, Wang Y (2008) Overlapping community detection in bipartite networks. In: 2008 IEEE \/ WIC \/ ACM International Conference on Web Intelligence, WI 2008, 9-12 December 2008, Sydney, NSW, Australia, Main Conference Proceedings. IEEE Computer Society, pp 176\u2013179. https:\/\/doi.org\/10.1109\/WIIAT.2008.98","DOI":"10.1109\/WIIAT.2008.98"},{"key":"2545_CR16","doi-asserted-by":"publisher","unstructured":"Hecking T, Steinert L, G\u00f6hnert T, Hoppe HU (2014) Incremental clustering of dynamic bipartite networks. In: 2014 European network intelligence conference, ENIC 2014, Wroclaw, Poland, September 29-30, 2014. IEEE Computer Society, pp 9\u201316. https:\/\/doi.org\/10.1109\/ENIC.2014.15","DOI":"10.1109\/ENIC.2014.15"},{"key":"2545_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.016108","volume":"78","author":"S Lehmann","year":"2008","unstructured":"Lehmann S, Schwartz M, Hansen LK (2008) Biclique communities. Phys Rev E 78:016108. https:\/\/doi.org\/10.1103\/PhysRevE.78.016108","journal-title":"Phys Rev E"},{"key":"2545_CR18","doi-asserted-by":"publisher","unstructured":"Himmel A, Molter H, Niedermeier R, Sorge M (2016) Enumerating maximal cliques in temporal graphs. In: Kumar R, Caverlee J, Tong H (eds) 2016 IEEE\/ACM international conference on advances in social networks analysis and mining, ASONAM 2016, San Francisco, CA, USA, August 18\u201321, 2016. IEEE Computer Society, pp 337\u2013344. https:\/\/doi.org\/10.1109\/ASONAM.2016.7752255","DOI":"10.1109\/ASONAM.2016.7752255"},{"issue":"9","key":"2545_CR19","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":"12","key":"2545_CR20","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","volume":"19","author":"J Li","year":"2007","unstructured":"Li J, Liu G, Li H, Wong L (2007) Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans Knowl Data Eng 19(12):1625\u20131637. https:\/\/doi.org\/10.1109\/TKDE.2007.190660","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2545_CR21","doi-asserted-by":"publisher","unstructured":"Chen L, Liu C, Zhou R, Xu J, Li J (2021) Efficient exact algorithms for maximum balanced biclique search in bipartite graphs. In: Li G, Li Z, Idreos S, Srivastava D (eds) SIGMOD \u201921: international conference on management of data, virtual event, China, June 20-25, 2021. ACM, pp 248\u2013260. https:\/\/doi.org\/10.1145\/3448016.3459241","DOI":"10.1145\/3448016.3459241"},{"key":"2545_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/J.TCS.2017.09.027","volume":"734","author":"Q Feng","year":"2018","unstructured":"Feng Q, Li S, Zhou Z, Wang J (2018) Parameterized algorithms for Edge Biclique and related problems. Theor Comput Sci 734:105\u2013118. https:\/\/doi.org\/10.1016\/J.TCS.2017.09.027","journal-title":"Theor Comput Sci"},{"key":"2545_CR23","doi-asserted-by":"publisher","unstructured":"Shaham E, Yu H, Li X (2016) On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach. In: Venkatasubramanian SC, Jr WM (eds) Proceedings of the 2016 SIAM international conference on data mining, Miami, Florida, USA, May 5\u20137, 2016. SIAM, pp 315\u2013323. https:\/\/doi.org\/10.1137\/1.9781611974348.36","DOI":"10.1137\/1.9781611974348.36"},{"issue":"4","key":"2545_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3390\/A10040113","volume":"10","author":"S Shahinpour","year":"2017","unstructured":"Shahinpour S, Shirvani S, Ertem Z, Butenko S (2017) Scale reduction techniques for computing maximum induced bicliques. Algorithms 10(4):113. https:\/\/doi.org\/10.3390\/A10040113","journal-title":"Algorithms"},{"key":"2545_CR25","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. https:\/\/doi.org\/10.1016\/j.tcs.2015.09.030","journal-title":"Theor Comput Sci"},{"key":"2545_CR26","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. https:\/\/doi.org\/10.1016\/J.IPL.2018.01.006","journal-title":"Inf Process Lett"},{"key":"2545_CR27","doi-asserted-by":"publisher","unstructured":"Banerjee S, Pal B (2019) On the enumeration of maximal ($$\\Delta $$, $$\\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, January 3-5, 2019. ACM, pp 112\u2013120. https:\/\/doi.org\/10.1145\/3297001.3297015","DOI":"10.1145\/3297001.3297015"},{"issue":"5","key":"2545_CR28","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. https:\/\/doi.org\/10.1093\/COMNET\/CNAC027","journal-title":"J Complex Netw"},{"key":"2545_CR29","doi-asserted-by":"publisher","unstructured":"Banerjee S, Pal B (2021) A two-phase approach for enumeration of maximal ($$\\Delta $$, $$\\gamma $$)-cliques of a temporal network. In: Strauss C, Kotsis G, Tjoa AM, Khalil I (eds). Database and expert systems applications\u201432nd international conference, DEXA 2021, Virtual Event, September 27\u201330, 2021, Proceedings, Part II. vol. 12924 of Lecture Notes in Computer Science. Springer. pp. 346\u2013357. https:\/\/doi.org\/10.1007\/978-3-030-86475-0_33","DOI":"10.1007\/978-3-030-86475-0_33"},{"key":"2545_CR30","doi-asserted-by":"publisher","unstructured":"Li R, Su J, Qin L, Yu JX, Dai Q (2018) Persistent community search in temporal networks. In: 34th IEEE international conference on data engineering, ICDE 2018, Paris, France, April 16-19, 2018. IEEE Computer Society. pp 797\u2013808. https:\/\/doi.org\/10.1109\/ICDE.2018.00077","DOI":"10.1109\/ICDE.2018.00077"},{"key":"2545_CR31","doi-asserted-by":"publisher","unstructured":"Bentert M, Himmel A, Molter H, Morik M, Niedermeier R, Saitenmacher R (2019) Listing all maximal k-plexes in temporal graphs. ACM J Exp Algorithmics 24(1):11.13:1\u20131.13:27. https:\/\/doi.org\/10.1145\/3325859","DOI":"10.1145\/3325859"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02545-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02545-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02545-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T15:51:19Z","timestamp":1762530679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02545-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2545"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02545-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,8,4]]},"assertion":[{"value":"11 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2025","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"}}]}}