{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:07:10Z","timestamp":1775815630247,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002108"],"award-info":[{"award-number":["62002108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2021jj40123"],"award-info":[{"award-number":["2021jj40123"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200101116"],"award-info":[{"award-number":["DP200101116"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00778-023-00786-0","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T05:02:55Z","timestamp":1678683775000},"page":"1137-1161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["(p,q)-biclique counting and enumeration for large sparse bipartite graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Jianye","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yun","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Dian","family":"Ouyang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"786_CR1","unstructured":"https:\/\/www.ncbi.nlm.nih.gov\/geo\/query\/acc.cgi?acc=GSE211394"},{"key":"786_CR2","doi-asserted-by":"crossref","unstructured":"Abidi, A., Zhou, R., Chen, L., Liu, C.: Pivot-based maximal biclique enumeration. In: IJCAI ages. p. 3558 (2020)","DOI":"10.24963\/ijcai.2020\/492"},{"key":"786_CR3","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Kanellakis, P., Grahne, G.: On the representation and querying of sets of possible worlds. In SIGMOD, p. 34 (1987)","DOI":"10.1145\/38714.38724"},{"key":"786_CR4","doi-asserted-by":"crossref","unstructured":"AndPan Xu, A.P.M., Tirthapura, S.: Mining maximal cliques from an uncertain graph. In ICDE. p. 243 (2015)","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"786_CR5","doi-asserted-by":"crossref","unstructured":"AndPan Xu, A.P.M., Tirthapura, S.: Enumeration of maximal cliques from an uncertain graph. TKDE. p. 543 (2017)","DOI":"10.1109\/TKDE.2016.2527643"},{"key":"786_CR6","doi-asserted-by":"crossref","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science. p. 163 (2016)","DOI":"10.1126\/science.aad9029"},{"key":"786_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. p. 1316 (2014)","DOI":"10.1145\/2623330.2623655"},{"key":"786_CR8","doi-asserted-by":"crossref","unstructured":"Borgatti, S.P., Everett, M.G.: Network analysis of 2-mode data. Soc. Netw. p. 243 (1997)","DOI":"10.1016\/S0378-8733(96)00301-2"},{"key":"786_CR9","doi-asserted-by":"crossref","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. In: Communications of the ACM. p. 575 (1973)","DOI":"10.1145\/362342.362367"},{"key":"786_CR10","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, p. 248 (2021)","DOI":"10.1145\/3448016.3459241"},{"key":"786_CR11","first-page":"93","volume":"8","author":"Y Cheng","year":"2000","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. Proc. Int. Conf. Intell. Syst. Mol. Biol. 8, 93 (2000)","journal-title":"Proc. Int. Conf. Intell. Syst. Mol. Biol."},{"key":"786_CR12","doi-asserted-by":"crossref","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. p. 210 (1985)","DOI":"10.1137\/0214017"},{"key":"786_CR13","doi-asserted-by":"crossref","unstructured":"Dai, Q., Li, R., Liao, M., Chen, H., Wang, G.: Fast maximal clique enumeration on uncertain graphs: a pivot-based approach. In: SIGMOD (2022)","DOI":"10.1145\/3514221.3526143"},{"key":"786_CR14","doi-asserted-by":"crossref","unstructured":"Danisch, M., Balalau, O., Sozio, M.: Listing k-cliques in sparse real-world graphs. In: WWW, p. 589 (2018)","DOI":"10.1145\/3178876.3186125"},{"key":"786_CR15","doi-asserted-by":"crossref","unstructured":"Deng, H., Lyu, M.R., King, I.: A generalized co-hits algorithm and its application to bipartite graphs. In: SIGKDD. p. 239 (2009)","DOI":"10.1145\/1557019.1557051"},{"key":"786_CR16","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In CIKM. p. 2047 (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"786_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90121-X","volume-title":"Arboricity and bipartite subgraph listing algorithms","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process, Lett (1994)"},{"key":"786_CR18","volume-title":"Parameterized algorithms for edge biclique and related problems","author":"Q Feng","year":"2017","unstructured":"Feng, Q., Li, S., Zhou, Z., Wang, J.: Parameterized algorithms for edge biclique and related problems. Theor. Comput, Sci (2017)"},{"key":"786_CR19","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Algorithms for graphic polymatroids and parametric s-sets. J. Algorithms. p. 48 (1999)","DOI":"10.1006\/jagm.1997.0904"},{"key":"786_CR20","doi-asserted-by":"crossref","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. p. 30 (1985)","DOI":"10.1137\/0218003"},{"key":"786_CR21","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NeurIPS. p. 1024 (2017)"},{"key":"786_CR22","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. (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"786_CR23","doi-asserted-by":"crossref","unstructured":"Huang, J., Antova, L., Koch, C., Olteanu, D.: Maybms: a probabilistic database management system. In: SIGMOD. p. 1071 (2009)","DOI":"10.1145\/1559845.1559984"},{"key":"786_CR24","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: SIGMOD. p. 77 (2016)","DOI":"10.1145\/2882903.2882913"},{"key":"786_CR25","doi-asserted-by":"crossref","unstructured":"Jia, Z., Lin, S., Ying, R., You, J., Leskovec, J., Aiken, A.: Redundancy-free computation for graph neural networks. In: SIGKDD. (2020)","DOI":"10.1145\/3394486.3403142"},{"key":"786_CR26","doi-asserted-by":"crossref","unstructured":"Latapy, M., Magnien, C., Vecchio, N.D.: Basic notions for the analysis of large two-mode networks. Soc. Netw. p. 31 (2008)","DOI":"10.1016\/j.socnet.2007.04.006"},{"key":"786_CR27","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. TKDE. p. 1625 (2007)","DOI":"10.1109\/TKDE.2007.190660"},{"key":"786_CR28","unstructured":"Li, R., Wang, P., Jia, P., Zhang, X., Zhao, J., Tao, J., Yuan, Y., Guan, X.: Approximately counting butterflies in large bipartite graph streams. TKDE. p. 1 (2021)"},{"key":"786_CR29","doi-asserted-by":"crossref","unstructured":"Lind, P.G., M.C.G., Herrmann, H.J.: Cycles and clustering in bipartite networks. Phys. Rev. E. p. 814 (2005)","DOI":"10.1103\/PhysRevE.72.056127"},{"key":"786_CR30","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. p. 1130 (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"786_CR31","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. In: PVLDB. p. 1359 (2020)","DOI":"10.14778\/3397230.3397234"},{"key":"786_CR32","doi-asserted-by":"crossref","unstructured":"Ma, C., Cheng, R., Lakshamanan, L.V.S., Grubernmannm, T., Fang, Y., Li, X.: Linc: a motif counting algorithm for uncertain graphs. In: PVLDB. p. 155 (2017)","DOI":"10.14778\/3364324.3364330"},{"key":"786_CR33","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"S Madeira","year":"2004","unstructured":"Madeira, S., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinf. 1, 24 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"786_CR34","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Algorithm Theory-SWAT, p. 260 (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"786_CR35","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pachocki, J., Peng, R., Tsourakakis, C.E., Xu, S.C.: Scalable large near-clique detection in large-scale networks via sampling. In: SIGKDD (2015)","DOI":"10.1145\/2783258.2783385"},{"key":"786_CR36","doi-asserted-by":"crossref","unstructured":"Mounir, M., Hamdy, M.N.: On biclustering of gene expression data. In: ICICIS. p. 641 (2015)","DOI":"10.1109\/IntelCIS.2015.7397290"},{"key":"786_CR37","doi-asserted-by":"crossref","unstructured":"Opsahl, T.: Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc. Netw. p. 159 (2013)","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"786_CR38","doi-asserted-by":"crossref","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature. p. 814 (2005)","DOI":"10.1038\/nature03607"},{"key":"786_CR39","doi-asserted-by":"crossref","unstructured":"Sanderson, M.J., Driskell, A.C., Ree, R.H., Eulenstein, O., Langley, S.: Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Mol. Biol. Evol. p. 1036 (2003)","DOI":"10.1093\/molbev\/msg115"},{"key":"786_CR40","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: KDD, p. 2150 (2018)","DOI":"10.1145\/3219819.3220097"},{"key":"786_CR41","doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A., Catalyurek, U.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: WWW, p. 927 (2015)","DOI":"10.1145\/2736277.2741640"},{"key":"786_CR42","doi-asserted-by":"crossref","unstructured":"Shaham, E., Yu, H., Li, X.: On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach. In: Proceedings of the 2016 SIAM International Conference on Data Mining, p. 315 (2016)","DOI":"10.1137\/1.9781611974348.36"},{"key":"786_CR43","doi-asserted-by":"crossref","unstructured":"Shahinpour, S., Shirvani, S., Ertem, Z., Butenko, S.: Scale reduction techniques for computing maximum induced bicliques. Algorithms (2017)","DOI":"10.3390\/a10040113"},{"key":"786_CR44","doi-asserted-by":"crossref","unstructured":"Sheshbolouki, A., \u00d6zsu, M.T.: Sgrapp: Butterfly approximation in streaming graphs. arXiv preprint arXiv:2101.12334 (2021)","DOI":"10.1145\/3495011"},{"key":"786_CR45","doi-asserted-by":"crossref","unstructured":"Sun, B., Danisch, M., Chan, T., Sozio, M.: Kclist++: asimple algorithm for finding k-clique densest subgraphs in large graphs. In PVLDB, p. 1628 (2020)","DOI":"10.14778\/3401960.3401962"},{"key":"786_CR46","doi-asserted-by":"crossref","unstructured":"Takeaki, U.: Implementation issues of clique enumeration algorithm. In: Special issue: theoretical computer science and discrete mathematics, Progress in Informatics, p. 25 (2012)","DOI":"10.2201\/NiiPi.2012.9.5"},{"key":"786_CR47","doi-asserted-by":"crossref","unstructured":"Todor, A., Dobra, A.,Kahveci, T.: Counting motifs in probabilistic biological networks. In: Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, p. 116, (2015)","DOI":"10.1145\/2808719.2808731"},{"key":"786_CR48","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In WWW, p. 1122 2015)","DOI":"10.1145\/2736277.2741098"},{"key":"786_CR49","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Igraph attention networks. In: ICLR (2017)"},{"key":"786_CR50","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhou, C., Wu, J., Dang, W., Zhu, X., Wang, J.: Deep structure learning for fraud detection. In: ICDM. p. 567 (2018)","DOI":"10.1109\/ICDM.2018.00072"},{"key":"786_CR51","doi-asserted-by":"crossref","unstructured":"Wang, J., Fu, A.W.C., Cheng, J.: Rectangle counting in large bipartite graphs. p. 17 (2014)","DOI":"10.1109\/BigData.Congress.2014.13"},{"key":"786_CR52","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. In: PVLDB. p. 1139 (2019)","DOI":"10.14778\/3339490.3339497"},{"key":"786_CR53","doi-asserted-by":"crossref","unstructured":"Yang, J., Peng, Y., Zhang, W.: (p,q)-biclique counting and enumeration for large sparse bipartite graphs. In: PVLDB, p. 141 (2022)","DOI":"10.14778\/3489496.3489497"},{"key":"786_CR54","doi-asserted-by":"crossref","unstructured":"Yang, Y., Fang, Y., Orlowska, M.E., Zhang, W., Lin, X.: Efficient bi-triangle counting for large bipartite networks. In: PVLDB. p. 984 (2021)","DOI":"10.14778\/3447689.3447702"},{"key":"786_CR55","unstructured":"Ying, Z., You, J., Morris, C., Ren, X., Hamilton, W., Leskovec, J.: Hierarchical graph representation learning with differentiable pooling. In: NeurIPS, p. 4801 (2018)"},{"key":"786_CR56","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 Bioinf. p. 1 (2014)","DOI":"10.1186\/1471-2105-15-110"},{"key":"786_CR57","doi-asserted-by":"crossref","unstructured":"Zhao, G., Wang, K., Zhang, W., Lin, X., Zhang, Y., and He, Y.: Efficient computation of cohesive subgraphs in uncertain bipartite graphs. In: ICDE. p. 2333 (2022)","DOI":"10.1109\/ICDE53745.2022.00220"},{"key":"786_CR58","doi-asserted-by":"crossref","unstructured":"Zhou, A., Wang, Y., Chen, L.: Butterfly counting on uncertain bipartite graphs. In: PVLDB. p. 211 (2022)","DOI":"10.14778\/3489496.3489502"},{"key":"786_CR59","doi-asserted-by":"crossref","unstructured":"Zuo, Z., Zhu, R.: Truss decomposition of uncertain graphs. Knowl. Inf. Syst. p. 197 (2016)","DOI":"10.1007\/s10115-016-0943-y"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00786-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-023-00786-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00786-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T14:53:08Z","timestamp":1744210388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-023-00786-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":59,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["786"],"URL":"https:\/\/doi.org\/10.1007\/s00778-023-00786-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,13]]},"assertion":[{"value":"6 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}