{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:59:54Z","timestamp":1775638794385,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:00:00Z","timestamp":1629504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:00:00Z","timestamp":1629504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB0204302"],"award-info":[{"award-number":["2018YFB0204302"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11280-021-00927-x","type":"journal-article","created":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T07:02:40Z","timestamp":1629529360000},"page":"857-877","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient maintenance for maximal bicliques in bipartite graph streams"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6057-6031","authenticated-orcid":false,"given":"Ziyi","family":"Ma","sequence":"first","affiliation":[]},{"given":"Yuling","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yikun","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jianye","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Chubo","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Huadong","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,21]]},"reference":[{"issue":"1","key":"927_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11\u201321 (2004)","journal-title":"Discret. Appl. Math."},{"key":"927_CR2","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: Proceedings of the 22nd International Conference on World Wide Web, pp 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"927_CR3","doi-asserted-by":"crossref","unstructured":"Chen, C.M., Wang, C.J., Tsai, M.F., Yang, Y.H.: Collaborative similarity embedding for recommender systems. In: The World Wide Web Conference, pp 2637\u20132643 (2019)","DOI":"10.1145\/3308558.3313493"},{"key":"927_CR4","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: Proceedings of the 2021 International Conference on Management of Data, pp 248\u2013260 (2021)","DOI":"10.1145\/3448016.3459241"},{"issue":"6","key":"927_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.ipl.2014.02.001","volume":"114","author":"P Damaschke","year":"2014","unstructured":"Damaschke, P.: Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. Inf. Process. Lett. 114(6), 317\u2013321 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"927_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TMSCS.2018.2802920","volume":"4","author":"A Das","year":"2018","unstructured":"Das, A., Tirthapura, S.: Incremental maintenance of maximal bicliques in a dynamic bipartite graph. IEEE Transactions on Multi-Scale Computing Systems 4(3), 231\u2013242 (2018)","journal-title":"IEEE Transactions on Multi-Scale Computing Systems"},{"key":"927_CR7","doi-asserted-by":"crossref","unstructured":"Deng, H., Lyu, M.R., King, I.: 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, pp 239\u2013248 (2009)","DOI":"10.1145\/1557019.1557051"},{"issue":"1-3","key":"927_CR8","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2005.01.014","volume":"337","author":"VM Dias","year":"2005","unstructured":"Dias, V.M., De Figueiredo, C.M., Szwarcfiter, J.L.: Generating bicliques of a graph in lexicographic order. Theor. Comput. Sci. 337(1-3), 240\u2013248 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"14","key":"927_CR9","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1016\/j.dam.2007.03.017","volume":"155","author":"VM Dias","year":"2007","unstructured":"Dias, V.M., de Figueiredo, C.M., Szwarcfiter, J.L.: On the generation of bicliques of a graph. Discret. Appl. Math. 155(14), 1826\u20131832 (2007)","journal-title":"Discret. Appl. Math."},{"key":"927_CR10","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using (\u03b1, \u03b2)-core. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp 2047\u20132050 (2017)","DOI":"10.1145\/3132847.3133130"},{"issue":"4","key":"927_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. Information Processing Letters 51(4), 207\u2013211 (1994)","journal-title":"Information Processing Letters"},{"issue":"7","key":"927_CR12","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. Discrete Applied Mathematics 157(7), 1447\u20131459 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"927_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2021.04.027","volume":"572","author":"Y He","year":"2021","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inform. Sci. 572, 277\u2013296 (2021)","journal-title":"Inform. Sci."},{"issue":"10","key":"927_CR14","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"927_CR15","doi-asserted-by":"crossref","unstructured":"Li, Y., Fan, J., Ovchinnikov, G., Karras, P.: Maximizing multifaceted network influence. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 446\u2013457. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00047"},{"key":"927_CR16","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (\u03b1, \u03b2)-core computation: an index-based approach. In: The World Wide Web Conference, pp 1130\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"5","key":"927_CR17","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 (\u03b1, \u03b2)-core computation in bipartite graphs. The VLDB Journal 29(5), 1075\u20131099 (2020)","journal-title":"The VLDB Journal"},{"key":"927_CR18","doi-asserted-by":"crossref","unstructured":"Liu, G., Sim, K., Li, J.: Efficient mining of large maximal bicliques. In: International Conference on Data Warehousing and Knowledge Discovery, pp 437\u2013448. Springer (2006)","DOI":"10.1007\/11823728_42"},{"key":"927_CR19","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Scandinavian Workshop on Algorithm Theory, pp 260\u2013272. Springer (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"issue":"5","key":"927_CR20","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TSC.2016.2523997","volume":"10","author":"AP Mukherjee","year":"2016","unstructured":"Mukherjee, A.P., Tirthapura, S.: Enumerating maximal bicliques from a large graph using mapreduce. IEEE Trans. Serv. Comput. 10(5), 771\u2013784 (2016)","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"1","key":"927_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s004930070035","volume":"20","author":"E Prisner","year":"2000","unstructured":"Prisner, E.: Bicliques in graphs i: bounds on their number. Combinatorica 20(1), 109\u2013117 (2000)","journal-title":"Combinatorica"},{"key":"927_CR22","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 2150\u20132159 (2018)","DOI":"10.1145\/3219819.3220097"},{"key":"927_CR23","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Zhang, Y., Sariy\u00fcce, A.E., Tirthapura, S.: Fleet: butterfly estimation from a bipartite graph stream. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp 1201\u20131210 (2019)","DOI":"10.1145\/3357384.3357983"},{"key":"927_CR24","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp 504\u2013512 (2018)","DOI":"10.1145\/3159652.3159678"},{"key":"927_CR25","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jpdc.2014.08.011","volume":"79","author":"M Svendsen","year":"2015","unstructured":"Svendsen, M., Mukherjee, A.P., Tirthapura, S.: Mining maximal cliques from a large graph using mapreduce: tackling highly uneven subproblem sizes. Journal of Parallel and Distributed Computing 79, 104\u2013114 (2015)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"927_CR26","doi-asserted-by":"crossref","unstructured":"Wang, J., De Vries, A.P., Reinders, M.J.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, pp 501\u2013508 (2006)","DOI":"10.1145\/1148170.1148257"},{"issue":"10","key":"927_CR27","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.14778\/3339490.3339497","volume":"12","author":"K Wang","year":"2019","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. Proceedings of the VLDB Endowment 12(10), 1139\u20131152 (2019)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"927_CR28","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"927_CR29","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. The VLDB Journal, pp 1\u201324 (2021)","DOI":"10.1007\/s00778-021-00658-5"},{"key":"927_CR30","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y. : Efficient and effective community search on large-scale bipartite graphs. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp 85\u201396. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00015"},{"key":"927_CR31","doi-asserted-by":"crossref","unstructured":"Wang, R., Liao, M., Qin, C.: An efficient algorithm for enumerating maximal bicliques from a dynamically growing graph. In: The International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, pp 329\u2013337. Springer (2019)","DOI":"10.1007\/978-3-030-32591-6_35"},{"key":"927_CR32","doi-asserted-by":"crossref","unstructured":"Xu, Y., Cheng, J., Fu, A.W.C., Bu, Y.: Distributed maximal clique computation. In: 2014 IEEE International Congress on Big Data, pp 160\u2013167. IEEE (2014)","DOI":"10.1109\/BigData.Congress.2014.31"},{"issue":"6","key":"927_CR33","doi-asserted-by":"publisher","first-page":"984","DOI":"10.14778\/3447689.3447702","volume":"14","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Fang, Y., Orlowska, M.E., Zhang, W., Lin, X.: Efficient bi-triangle counting for large bipartite networks. Proceedings of the VLDB Endowment 14(6), 984\u2013996 (2021)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"927_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00778-017-0487-0","volume":"27","author":"X Zhao","year":"2018","unstructured":"Zhao, X., Xiao, C., Lin, X., Zhang, W., Wang, Y.: Efficient structure similarity searches: a partition-based approach. The VLDB Journal 27(1), 53\u201378 (2018)","journal-title":"The VLDB Journal"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00927-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00927-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00927-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T11:19:27Z","timestamp":1646133567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00927-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,21]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00927-x","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,21]]},"assertion":[{"value":"22 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}