{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:54:20Z","timestamp":1767311660774,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819539055","type":"print"},{"value":"9789819539062","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-3906-2_7","type":"book-chapter","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:49:42Z","timestamp":1767311382000},"page":"103-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Maximum $$(\\alpha ,\\beta )$$-Quasi Biclique Computation on\u00a0Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Bin","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongru","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengfeng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5786-6938","authenticated-orcid":false,"given":"Shengxin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"7_CR1","unstructured":"Technical Report and Code: https:\/\/github.com\/lb2003\/mvqb"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M.G., Sudarsky, S.: Massive quasi-clique detection. In: LATIN, pp. 598\u2013612 (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Abidi, A., Zhou, R., Chen, L., Liu, C.: Pivot-based maximal biclique enumeration. In: IJCAI, pp. 3558\u20133564 (2020)","DOI":"10.24963\/ijcai.2020\/492"},{"key":"7_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, pp. 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-13-S4-S1","volume":"13","author":"WC Chang","year":"2012","unstructured":"Chang, W.C., Vakati, S., Krause, R., Eulenstein, O.: Exploring biological interaction networks with tailored weighted quasi-bicliques. BMC Bioinf. 13, 1\u20139 (2012)","journal-title":"BMC Bioinf."},{"issue":"8","key":"7_CR6","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":"7_CR7","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. Proc. ACM Manag. Data 2(3), 1\u201326 (2024)","DOI":"10.1145\/3654938"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Dai, Q., Li, R.H., Ye, X., Liao, M., Zhang, W., Wang, G.: Hereditary cohesive subgraphs enumeration on bipartite graphs: The power of pivot-based approaches. Proc. ACM Manag. Data 1(2), 1\u201326 (2023)","DOI":"10.1145\/3589283"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.2001.1199","volume":"41","author":"M Dawande","year":"2001","unstructured":"Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms 41(2), 388\u2013403 (2001)","journal-title":"J. Algorithms"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: CIKM, pp. 2047\u20132050 (2017)","DOI":"10.1145\/3132847.3133130"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Ignatov, D.I., Ivanova, P., Zamaletdinova, A.: Mixed integer programming for searching maximum quasi-bicliques. In: ICNA, pp. 19\u201335 (2018)","DOI":"10.1007\/978-3-030-37157-9_2"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45735-6_1","volume-title":"String Processing and Information Retrieval","author":"M Ley","year":"2002","unstructured":"Ley, M.: The DBLP computer science bibliography: evolution, research issues, perspectives. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 1\u201310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45735-6_1"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient $$(\\alpha , \\beta )$$-core computation: an index-based approach. In: WWW, pp. 1130\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Liu, H.F., Su, C.T., Chu, A.C.: Fast quasi-biclique mining with Giraph. In: Proceedings of the IEEE International Congress on Big Data, pp. 347\u2013354 (2013)","DOI":"10.1109\/BigData.Congress.2013.53"},{"key":"7_CR16","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"},{"issue":"2","key":"7_CR17","first-page":"354","volume":"7","author":"X Liu","year":"2008","unstructured":"Liu, X., Li, J., Wang, L.: Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application. TCBB 7(2), 354\u2013364 (2008)","journal-title":"TCBB"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Luo, W., Li, K., Zhou, X., Gao, Y., Li, K.: Maximum biplex search over bipartite graphs. In: ICDE, pp. 898\u2013910 (2022)","DOI":"10.1109\/ICDE53745.2022.00072"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Luo, W., Yang, Q., Fang, Y., Zhou, X.: Efficient core maintenance in large bipartite graphs. Proc. ACM Manag. Data 1(3), 1\u201326 (2023)","DOI":"10.1145\/3617329"},{"issue":"6","key":"7_CR20","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":"7_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/B:MACH.0000033117.77257.41","volume":"56","author":"N Mishra","year":"2004","unstructured":"Mishra, N., Ron, D., Swaminathan, R.: A new conceptual clustering framework. Mach. Learn. 56, 115\u2013151 (2004)","journal-title":"Mach. Learn."},{"issue":"3","key":"7_CR22","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."},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo, P., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"7_CR24","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. Stat. Anal. Data Min. 2(4), 255\u2013273 (2009)","journal-title":"Stat. Anal. Data Min."},{"issue":"08","key":"7_CR25","first-page":"7921","volume":"35","author":"J Wang","year":"2022","unstructured":"Wang, J., Yang, J., Zhang, C., Lin, X.: Efficient maximum edge-weighted biclique search on large bipartite graphs. TKDE 35(08), 7921\u20137934 (2022)","journal-title":"TKDE"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Wang, J., De\u00a0Vries, A.P., Reinders, M.J.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: SIGIR, pp. 501\u2013508 (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Qin, L., Zhou, A.: Efficient personalized maximum biclique search. In: ICDE, pp. 498\u2013511 (2022)","DOI":"10.1109\/ICDE53745.2022.00042"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10878-011-9392-4","volume":"25","author":"L Wang","year":"2013","unstructured":"Wang, L.: Near optimal solutions for maximum quasi-bicliques. J. Comb. Optim. 25, 481\u2013497 (2013)","journal-title":"J. Comb. Optim."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C.: Maximum $$k$$-biplex search on bipartite graphs: a symmetric-BK branching approach. Proc. ACM Manag. Data 1(1), 1\u201326 (2023)","DOI":"10.1145\/3588729"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C., Liu, S., Yan, D.: Efficient algorithms for maximal $$k$$-biplex enumeration. In: SIGMOD, pp. 860\u2013873 (2022)","DOI":"10.1145\/3514221.3517847"},{"key":"7_CR31","unstructured":"Yu, K., Long, C., P, D., Chakraborty, T.: On efficient large maximal biplex discovery. TKDE 35(1), 824\u2013829 (2023)"},{"key":"7_CR32","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":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3906-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:49:45Z","timestamp":1767311385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3906-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819539055","9789819539062"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3906-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}