{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T19:05:15Z","timestamp":1781204715480,"version":"3.54.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:00:00Z","timestamp":1755993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:00:00Z","timestamp":1755993600000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00778-025-00939-3","type":"journal-article","created":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T17:58:56Z","timestamp":1756058336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient maximum signed biclique and biplex identification in signed bipartite graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Renjie","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,24]]},"reference":[{"key":"939_CR1","doi-asserted-by":"crossref","unstructured":"Abidi, A., Zhou, R., Chen, L., Liu, C.: Pivot-based maximal biclique enumeration. In: IJCAI (2021)","DOI":"10.24963\/ijcai.2020\/492"},{"issue":"2","key":"939_CR2","first-page":"15","volume":"30","author":"E Adar","year":"2007","unstructured":"Adar, E., Re, C.: Managing uncertainty in social networks. IEEE Data Eng. Bull. 30(2), 15\u201322 (2007)","journal-title":"IEEE Data Eng. Bull."},{"key":"939_CR3","doi-asserted-by":"crossref","unstructured":"Akoglu, L., Chandy, R., Faloutsos, C.: Opinion fraud detection in online reviews by network effects. In: AAAI, vol.\u00a07, pp. 2\u201311 (2013)","DOI":"10.1609\/icwsm.v7i1.14380"},{"key":"939_CR4","doi-asserted-by":"crossref","unstructured":"Beutel, A., Xu, W., Guruswami, V., Palow, C., Faloutsos, C.: Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In: WWW (2013)","DOI":"10.1145\/2488388.2488400"},{"issue":"2","key":"939_CR5","first-page":"1791","volume":"35","author":"C Chen","year":"2021","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$\\theta $$-clique identification in large signed graphs. TKDE 35(2), 1791\u20131802 (2021)","journal-title":"TKDE"},{"key":"939_CR6","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Zhou, R., Xu, J., Li, J.: Efficient exact algorithms for maximum balanced biclique search in bipartite graphs. In: SIGMOD, pp. 248\u2013260 (2021)","DOI":"10.1145\/3448016.3459241"},{"issue":"8","key":"939_CR7","first-page":"1559","volume":"15","author":"L Chen","year":"2022","unstructured":"Chen, L., Liu, C., Zhou, R., Xu, J., Li, J.: Efficient maximal biclique enumeration for large sparse bipartite graphs. PVLDB 15(8), 1559\u20131571 (2022)","journal-title":"PVLDB"},{"key":"939_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Z., Yuan, L., Lin, X., Qin, L., Yang, J.: Efficient maximal balanced clique enumeration in signed networks. In: WWW, pp. 339\u2013349 (2020)","DOI":"10.1145\/3366423.3380119"},{"key":"939_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, K., Li, J., Tang, J., Liu, H.: Unsupervised sentiment analysis with signed social networks. In: AAAI, vol.\u00a031, pp. 3429\u20133435 (2017)","DOI":"10.1609\/aaai.v31i1.11008"},{"issue":"3","key":"939_CR10","first-page":"332","volume":"17","author":"KH Chung","year":"2023","unstructured":"Chung, K.H., Zhou, A., Wang, Y., Chen, L.: Maximum balanced (k, $$\\epsilon $$)-bitruss detection in signed bipartite graph. PVLDB 17(3), 332\u2013344 (2023)","journal-title":"PVLDB"},{"key":"939_CR11","doi-asserted-by":"crossref","unstructured":"Dai, Q., Li, R.H., Cui, D., Liao, M., Qiu, Y.X., Wang, G.: Efficient maximal biplex enumerations with improved worst-case time guarantee. SIGMOD pp. 1\u201326 (2024)","DOI":"10.1145\/3654938"},{"key":"939_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/bs.apcsb.2017.09.002","volume":"111","author":"J De Las Rivas","year":"2018","unstructured":"De Las Rivas, J., Alonso-L\u00f3pez, D., Arroyo, M.M.: Human interactomics: comparative analysis of different protein interaction resources and construction of a cancer protein-drug bipartite network. Adv. Protein Chem. Struct. Biol. 111, 263\u2013282 (2018)","journal-title":"Adv. Protein Chem. Struct. Biol."},{"key":"939_CR13","doi-asserted-by":"crossref","unstructured":"Derr, T., Johnson, C., Chang, Y., Tang, J.: Balance in signed bipartite networks. In: CIKM, pp. 1221\u20131230 (2019)","DOI":"10.1145\/3357384.3358009"},{"key":"939_CR14","doi-asserted-by":"crossref","unstructured":"Gangireddy, S.C.R., Long, C., Chakraborty, T.: Unsupervised fake news detection: A graph-based approach. In: Proceedings of the 31st ACM conference on hypertext and social media, pp. 75\u201383 (2020)","DOI":"10.1145\/3372923.3404783"},{"issue":"7","key":"939_CR15","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1016\/j.dam.2008.10.010","volume":"157","author":"A G\u00e9ly","year":"2009","unstructured":"G\u00e9ly, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discret. Appl. Math. 157(7), 1447\u20131459 (2009)","journal-title":"Discret. Appl. Math."},{"key":"939_CR16","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Cautis, B., Maniu, S., Thilikos, D.M., Vazirgiannis, M.: Quantifying trust dynamics in signed graphs, the s-cores approach. In: SDM (2014)","DOI":"10.1137\/1.9781611973440.77"},{"key":"939_CR17","doi-asserted-by":"crossref","unstructured":"Gunnemann, S., Muller, E., Raubach, S., Seidl, T.: Flexible fault tolerant subspace clustering for data with missing values. In: ICDE, pp. 231\u2013240 (2011)","DOI":"10.1109\/ICDM.2011.70"},{"issue":"1","key":"939_CR18","first-page":"57","volume":"29","author":"X He","year":"2016","unstructured":"He, X., Gao, M., Kan, M.Y., Wang, D.: Birank: Towards ranking on bipartite graphs. TKDE 29(1), 57\u201371 (2016)","journal-title":"TKDE"},{"key":"939_CR19","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: Fraudar: Bounding graph fraud in the face of camouflage. In: SIGKDD, pp. 895\u2013904 (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"939_CR20","doi-asserted-by":"crossref","unstructured":"Huang, J., Shen, H., Cao, Q., Tao, S., Cheng, X.: Signed bipartite graph neural networks. In: CIKM (2021)","DOI":"10.1145\/3459637.3482392"},{"key":"939_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"939_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s13278-020-00697-w","volume":"10","author":"W Kudo","year":"2020","unstructured":"Kudo, W., Nishiguchi, M., Toriumi, F.: Gcnext: graph convolutional network with expanded balance theory for fraudulent user detection. Soc. Netw. Anal. Min. 10(1), 85 (2020)","journal-title":"Soc. Netw. Anal. Min."},{"key":"939_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.physa.2017.12.089","volume":"495","author":"L Li","year":"2018","unstructured":"Li, L., Gu, K., Zeng, A., Fan, Y., Di, Z.: Modeling online social signed networks. XXPhys. A 495, 345\u2013352 (2018)","journal-title":"XXPhys. A"},{"key":"939_CR24","doi-asserted-by":"crossref","unstructured":"Li, R.H., Dai, Q., Qin, L., Wang, G., Xiao, X., Yu, J.X., Qiao, S.: Efficient signed clique search in signed networks. In: ICDE, pp. 245\u2013256 (2018)","DOI":"10.1109\/ICDE.2018.00031"},{"issue":"5","key":"939_CR25","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00778-020-00606-9","volume":"29","author":"B Liu","year":"2020","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs. VLDB J. 29(5), 1075\u20131099 (2020)","journal-title":"VLDB J."},{"key":"939_CR26","doi-asserted-by":"crossref","unstructured":"Liu, G., Sim, K., Li, J.: Efficient mining of large maximal bicliques. In: DaWaK, pp. 437\u2013448 (2006)","DOI":"10.1007\/11823728_42"},{"key":"939_CR27","doi-asserted-by":"crossref","unstructured":"Liu, Q., Liao, X., Huang, X., Xu, J., Gao, Y.: Distributed ($$\\alpha $$, $$\\beta $$)-core decomposition over bipartite graphs. In: ICDE, pp. 909\u2013921 (2023)","DOI":"10.1109\/ICDE55515.2023.00075"},{"key":"939_CR28","doi-asserted-by":"crossref","unstructured":"Luo, W., Li, K., Zhou, X., Gao, Y., Li, K.: Maximum biplex search over bipartite graphs. In: ICDE (2022)","DOI":"10.1109\/ICDE53745.2022.00072"},{"issue":"6","key":"939_CR29","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s00778-021-00681-6","volume":"31","author":"B Lyu","year":"2022","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum and top-k diversified biclique search at scale. VLDB J. 31(6), 1365\u20131389 (2022)","journal-title":"VLDB J."},{"key":"939_CR30","doi-asserted-by":"crossref","unstructured":"Pan, D., Zhou, X., Luo, W., Yang, Z., Li, Q., Gao, Y., Li, K.: Accelerating maximum biplex search over large bipartite graphs. VLDB J. 34(1) (2025)","DOI":"10.1007\/s00778-024-00882-9"},{"issue":"3","key":"939_CR31","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is np-complete. Discret. Appl. Math. 131(3), 651\u2013654 (2003)","journal-title":"Discret. Appl. Math."},{"key":"939_CR32","doi-asserted-by":"crossref","unstructured":"Poernomo, A.K., Gopalkrishnan, V.: Towards efficient mining of proportional fault-tolerant frequent itemsets. In: SIGKDD, pp. 697\u2013706 (2009)","DOI":"10.1145\/1557019.1557097"},{"issue":"4","key":"939_CR33","first-page":"463","volume":"13","author":"L Qin","year":"2019","unstructured":"Qin, L., Peng, Y., Zhang, Y., Lin, X., Zhang, W., Zhou, J.: Towards bridging theory and practice: hop-constrained st simple path enumeration. PVLDB 13(4), 463\u2013476 (2019)","journal-title":"PVLDB"},{"issue":"12","key":"939_CR34","first-page":"1876","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., Cen, W., Qian, Z., Peng, Y., Zhang, Y., Lin, X., Zhou, J.: Real-time constrained cycle detection in large dynamic graphs. PVLDB 11(12), 1876\u20131888 (2018)","journal-title":"PVLDB"},{"issue":"1","key":"939_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"issue":"4","key":"939_CR36","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/sam.10051","volume":"2","author":"K Sim","year":"2009","unstructured":"Sim, K., Li, J., Gopalkrishnan, V., Liu, G.: Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks. Statistical Analysis and Data Mining: The ASA Data Science Journal 2(4), 255\u2013273 (2009)","journal-title":"Statistical Analysis and Data Mining: The ASA Data Science Journal"},{"key":"939_CR37","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, W., Zhang, Y., Lin, X.: Efficient maximum signed biclique identification. In: ICDE, pp. 1313\u20131325 (2023)","DOI":"10.1109\/ICDE55515.2023.00105"},{"issue":"10","key":"939_CR38","first-page":"5051","volume":"34","author":"R Sun","year":"2020","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. TKDE 34(10), 5051\u20135055 (2020)","journal-title":"TKDE"},{"key":"939_CR39","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Chen, C., Wang, X., Zhang, W., Lin, X.: Maximal balanced signed biclique enumeration in signed bipartite graphs. In: ICDE, pp. 1887\u20131899 (2022)","DOI":"10.1109\/ICDE53745.2022.00187"},{"issue":"12","key":"939_CR40","first-page":"12513","volume":"35","author":"R Sun","year":"2023","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Clique identification in signed graphs: a balance theory based model. TKDE 35(12), 12513\u201312527 (2023)","journal-title":"TKDE"},{"issue":"3","key":"939_CR41","first-page":"1069","volume":"36","author":"R Sun","year":"2023","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Efficient balanced signed biclique search in signed bipartite graphs. TKDE 36(3), 1069\u20131083 (2023)","journal-title":"TKDE"},{"key":"939_CR42","doi-asserted-by":"crossref","unstructured":"Sun, R., Zhu, Q., Chen, C., Wang, X., Zhang, Y., Wang, X.: Discovering cliques in signed networks based on balance theory. In: DASFAA, pp. 666\u2013674 (2020)","DOI":"10.1007\/978-3-030-59416-9_43"},{"issue":"9","key":"939_CR43","first-page":"4618","volume":"36","author":"J Wang","year":"2024","unstructured":"Wang, J., Yang, J., Gu, Z., Ouyang, D., Tian, Z., Lin, X.: Efficient maximal biclique enumeration on large signed bipartite graphs. TKDE 36(9), 4618\u20134631 (2024)","journal-title":"TKDE"},{"issue":"12","key":"939_CR44","first-page":"12634","volume":"35","author":"J Wang","year":"2023","unstructured":"Wang, J., Yang, J., Ma, Z., Zhang, C., Yang, S., Zhang, W.: Efficient maximal biclique enumeration on large uncertain bipartite graphs. TKDE 35(12), 12634\u201312648 (2023)","journal-title":"TKDE"},{"issue":"2","key":"939_CR45","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00778-021-00658-5","volume":"31","author":"K Wang","year":"2022","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 31(2), 203\u2013226 (2022)","journal-title":"VLDB J."},{"key":"939_CR46","doi-asserted-by":"crossref","unstructured":"Wu, Y., Sun, R., Chen, C., Wang, X., Zhu, Q.: Maximum signed (k, r)-truss identification in signed networks. In: CIKM, pp. 3337\u20133340 (2020)","DOI":"10.1145\/3340531.3417457"},{"issue":"11","key":"939_CR47","first-page":"3243","volume":"17","author":"Y Wu","year":"2024","unstructured":"Wu, Y., Sun, R., Wang, X., Wen, D., Zhang, Y., Qin, L., Lin, X.: Efficient maximal frequent group enumeration in temporal bipartite graphs. PVLDB 17(11), 3243\u20133255 (2024)","journal-title":"PVLDB"},{"key":"939_CR48","doi-asserted-by":"crossref","unstructured":"Ye, X., Li, R.H., Dai, Q., Qin, H., Wang, G.: Efficient biclique counting in large bipartite graphs. SIGMOD pp. 1\u201326 (2023)","DOI":"10.1145\/3588932"},{"issue":"2","key":"939_CR49","first-page":"951","volume":"37","author":"J Yu","year":"2025","unstructured":"Yu, J., Wang, H., Wang, X., Li, Z., Qin, L., Zhang, W., Liao, J., Zhang, Y., Yang, B.: Temporal insights for group-based fraud detection on e-commerce platforms. TKDE 37(2), 951\u2013965 (2025)","journal-title":"TKDE"},{"key":"939_CR50","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C.: Maximum k-biplex search on bipartite graphs: A symmetric-bk branching approach. SIGMOD pp. 1\u201326 (2023)","DOI":"10.1145\/3588729"},{"issue":"1","key":"939_CR51","first-page":"824","volume":"35","author":"K Yu","year":"2021","unstructured":"Yu, K., Long, C., Deepak, P., Chakraborty, T.: On efficient large maximal biplex discovery. TKDE 35(1), 824\u2013829 (2021)","journal-title":"TKDE"},{"key":"939_CR52","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C., Liu, S., Yan, D.: Efficient algorithms for maximal k-biplex enumeration. In: SIGMOD (2022)","DOI":"10.1145\/3514221.3517847"},{"key":"939_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Phillips, C.A., Rogers, G.L., Baker, E.J., Chesler, E.J., Langston, M.A.: On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinformatics 15(1), 1\u201318 (2014)","DOI":"10.1186\/1471-2105-15-110"},{"key":"939_CR54","doi-asserted-by":"crossref","unstructured":"Zhao, J., Sun, R., Zhu, Q., Wang, X., Chen, C.: Community identification in signed networks: a k-truss based model. In: CIKM, pp. 2321\u20132324 (2020)","DOI":"10.1145\/3340531.3412117"},{"issue":"8","key":"939_CR55","first-page":"7994","volume":"35","author":"Y Zhao","year":"2023","unstructured":"Zhao, Y., Chen, Z., Chen, C., Wang, X., Lin, X., Zhang, W.: Finding the maximum k-balanced biclique on weighted bipartite graphs. TKDE 35(8), 7994\u20138007 (2023)","journal-title":"TKDE"},{"key":"939_CR56","doi-asserted-by":"crossref","unstructured":"Zou, Z.: Bitruss decomposition of bipartite graphs. In: DASFAA, pp. 218\u2013233 (2016)","DOI":"10.1007\/978-3-319-32049-6_14"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00939-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00939-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00939-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T12:03:59Z","timestamp":1758197039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00939-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,24]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["939"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00939-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,24]]},"assertion":[{"value":"27 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"60"}}