{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:08:20Z","timestamp":1747886900604,"version":"3.41.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National KeyR&D Program of China","award":["No.2022YFB4500800"],"award-info":[{"award-number":["No.2022YFB4500800"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62072089"],"award-info":[{"award-number":["62072089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s11280-025-01347-x","type":"journal-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:19:15Z","timestamp":1746436755000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Identifying key nodes for enhancing community stability in bipartite networks"],"prefix":"10.1007","volume":"28","author":[{"given":"Jinyi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhana","family":"Choudhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junchang","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"1347_CR1","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1148170.1148257","DOI":"10.1145\/1148170.1148257"},{"key":"1347_CR2","doi-asserted-by":"publisher","unstructured":"Ley, M.: The dblp computer science bibliography: Evolution, research issues, perspectives. In: SPIRE, pp. 1\u201310 (2002). https:\/\/doi.org\/10.1007\/3-540-45735-6_1","DOI":"10.1007\/3-540-45735-6_1"},{"key":"1347_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Wang, K., Lin, X., Zhang, W., Qin, L., Zhang, Y.: Efficiently answering reachability and path queries on temporal bipartite graphs. PVLDB (2021)","DOI":"10.14778\/3467861.3467873"},{"issue":"4","key":"1347_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.046115","volume":"76","author":"T Zhou","year":"2007","unstructured":"Zhou, T., Ren, J., Medo, M., Zhang, Y.-C.: Bipartite network projection and personal recommendation. Phys. Rev. E 76(4), 046115 (2007). https:\/\/doi.org\/10.1103\/PhysRevE.76.046115","journal-title":"Phys. Rev. E"},{"issue":"3","key":"1347_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3003725","volume":"35","author":"D Zhang","year":"2017","unstructured":"Zhang, D., Guo, L., Nie, L., Shao, J., Wu, S., Shen, H.T.: Targeted advertising in public transportation systems with quantitative evaluation. TOIS 35(3), 1\u201329 (2017). https:\/\/doi.org\/10.1145\/3003725","journal-title":"TOIS"},{"key":"1347_CR6","doi-asserted-by":"publisher","unstructured":"Zhang, J., Kong, X., Yu, P.S.: Transferring heterogeneous links across location-based social networks. In: WSDM, pp. 303\u2013312 (2014). https:\/\/doi.org\/10.1145\/2556195.2559894","DOI":"10.1145\/2556195.2559894"},{"key":"1347_CR7","doi-asserted-by":"publisher","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: Olak: An efficient algorithm to prevent unraveling in social networks. PVLDB 10(6), 649\u2013660 (2017). https:\/\/doi.org\/10.14778\/3055330.3055332","DOI":"10.14778\/3055330.3055332"},{"key":"1347_CR8","doi-asserted-by":"publisher","unstructured":"Laishram, R., Erdem\u00a0Sar, A., Eliassi-Rad, T., Pinar, A., Soundarajan, S.: Residual core maximization: An efficient algorithm for maximizing the size of the k-core. In: SDM, pp. 325\u2013333 (2020). https:\/\/doi.org\/10.1137\/1.9781611976236.37","DOI":"10.1137\/1.9781611976236.37"},{"issue":"1","key":"1347_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TKDE.2018.2880976","volume":"32","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Li, C., Zhang, Y., Qin, L., Zhang, W.: Finding critical users in social communities: The collapsed core and truss problems. IEEE Trans. Knowl. Data Eng. 32(1), 78\u201391 (2020). https:\/\/doi.org\/10.1109\/TKDE.2018.2880976","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1347_CR10","doi-asserted-by":"publisher","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: CIKM, pp. 2047\u20132050 (2017). https:\/\/doi.org\/10.1145\/3132847.3133130","DOI":"10.1145\/3132847.3133130"},{"key":"1347_CR11","doi-asserted-by":"publisher","unstructured":"Ahmed, A., Batagelj, V., Fu, X., Hong, S.-H., Merrick, D., Mrvar, A.: Visualisation and analysis of the internet movie database. In: APVIS, pp. 17\u201324 (2007). https:\/\/doi.org\/10.1109\/APVIS.2007.329304","DOI":"10.1109\/APVIS.2007.329304"},{"key":"1347_CR12","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/3308558.3313522","DOI":"10.1145\/3308558.3313522"},{"issue":"5","key":"1347_CR13","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). https:\/\/doi.org\/10.1007\/s00778-020-00606-9","journal-title":"VLDB J."},{"key":"1347_CR14","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/ICDE55515.2023.00075","DOI":"10.1109\/ICDE55515.2023.00075"},{"key":"1347_CR15","doi-asserted-by":"publisher","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Li, S.: Discovering hierarchy of bipartite graphs with cohesive subgraphs. In: ICDE, pp. 2291\u20132305 (2022). https:\/\/doi.org\/10.1109\/ICDE53745.2022.00217","DOI":"10.1109\/ICDE53745.2022.00217"},{"key":"1347_CR16","doi-asserted-by":"publisher","unstructured":"Zhao, G., Wang, K., Zhang, W., Lin, X., Zhang, Y., He, Y.: Efficient computation of cohesive subgraphs in uncertain bipartite graphs. In: ICDE, pp. 2333\u20132345 (2022). https:\/\/doi.org\/10.1109\/ICDE53745.2022.00220","DOI":"10.1109\/ICDE53745.2022.00220"},{"issue":"11","key":"1347_CR17","doi-asserted-by":"publisher","first-page":"11165","DOI":"10.1109\/TKDE.2023.3234567","volume":"35","author":"K Wang","year":"2023","unstructured":"Wang, K., Zhao, G., Zhang, W., Lin, X., Zhang, Y., He, Y., Li, C.: Cohesive subgraph discovery over uncertain bipartite graphs. IEEE Trans. Knowl. Data Eng. 35(11), 11165\u201311179 (2023). https:\/\/doi.org\/10.1109\/TKDE.2023.3234567","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1347_CR18","doi-asserted-by":"publisher","unstructured":"Zou, Z.: Bitruss decomposition of bipartite graphs. In: DASFAA, pp. 218\u2013233 (2016). https:\/\/doi.org\/10.1007\/978-3-319-32049-6_14","DOI":"10.1007\/978-3-319-32049-6_14"},{"key":"1347_CR19","doi-asserted-by":"publisher","unstructured":"Sar\u0131y\u00fcce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: WSDM, pp. 504\u2013512 (2018). https:\/\/doi.org\/10.1145\/3159652.3159678","DOI":"10.1145\/3159652.3159678"},{"key":"1347_CR20","doi-asserted-by":"publisher","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: ICDE, pp. 661\u2013672 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00063","DOI":"10.1109\/ICDE48307.2020.00063"},{"issue":"3","key":"1347_CR21","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 Trans. Multi-Scale Comput. Syst. 4(3), 231\u2013242 (2018). https:\/\/doi.org\/10.1109\/TMSCS.2018.2802920","journal-title":"IEEE Trans. Multi-Scale Comput. Syst."},{"key":"1347_CR22","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. PVLDB (2020)","DOI":"10.14778\/3397230.3397234"},{"key":"1347_CR23","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/3448016.3459241","DOI":"10.1145\/3448016.3459241"},{"issue":"8","key":"1347_CR24","doi-asserted-by":"publisher","first-page":"7994","DOI":"10.1109\/TKDE.2022.3206351","volume":"35","author":"Y Zhao","year":"2022","unstructured":"Zhao, Y., Chen, Z., Chen, C., Wang, X., Lin, X., Zhang, W.: Finding the maximum $$k$$-balanced biclique on weighted bipartite graphs. IEEE Trans. Knowl. Data Eng. 35(8), 7994\u20138007 (2022). https:\/\/doi.org\/10.1109\/TKDE.2022.3206351","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"1347_CR25","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11280-021-00927-x","volume":"25","author":"Z Ma","year":"2022","unstructured":"Ma, Z., Liu, Y., Hu, Y., Yang, J., Liu, C., Dai, H.: Efficient maintenance for maximal bicliques in bipartite graph streams. World Wide Web 25(2), 857\u2013877 (2022). https:\/\/doi.org\/10.1007\/s11280-021-00927-x","journal-title":"World Wide Web"},{"key":"1347_CR26","doi-asserted-by":"publisher","unstructured":"Hao, Y., Zhang, M., Wang, X., Chen, C.: Cohesive subgraph detection in large bipartite networks. In: SSDBM, pp. 1\u20134 (2020). https:\/\/doi.org\/10.1145\/3400903.3400925","DOI":"10.1145\/3400903.3400925"},{"issue":"12","key":"1347_CR27","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.: 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 (2007). https:\/\/doi.org\/10.1109\/TKDE.2007.190660","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"1347_CR28","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unraveling in social networks: The anchored k-core problem. SIAM J. Discrete Math. 29(3), 1452\u20131475 (2015). https:\/\/doi.org\/10.1137\/14097032X","journal-title":"SIAM J. Discrete Math."},{"key":"1347_CR29","doi-asserted-by":"publisher","unstructured":"Linghu, Q., Zhang, F., Lin, X., Zhang, W., Zhang, Y.: Global reinforcement of social networks: The anchored coreness problem. In: SIGMOD, pp. 2211\u20132226 (2020). https:\/\/doi.org\/10.1145\/3318464.3389744","DOI":"10.1145\/3318464.3389744"},{"issue":"2","key":"1347_CR30","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00778-021-00673-6","volume":"31","author":"Q Linghu","year":"2022","unstructured":"Linghu, Q., Zhang, F., Lin, X., Zhang, W., Zhang, Y.: Anchored coreness: efficient reinforcement of social networks. VLDB J. 31(2), 227\u2013252 (2022). https:\/\/doi.org\/10.1007\/s00778-021-00673-6","journal-title":"VLDB J."},{"issue":"2","key":"1347_CR31","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11280-021-00905-3","volume":"25","author":"F Zhang","year":"2022","unstructured":"Zhang, F., Xie, J., Wang, K., Yang, S., Jiang, Y.: Discovering key users for defending network structural stability. World Wide Web 25(2), 679\u2013701 (2022). https:\/\/doi.org\/10.1007\/s11280-021-00905-3","journal-title":"World Wide Web"},{"issue":"5","key":"1347_CR32","doi-asserted-by":"publisher","first-page":"3709","DOI":"10.1007\/s11280-023-01196-6","volume":"26","author":"Q Luo","year":"2023","unstructured":"Luo, Q., Yu, D., Cai, Z., Zheng, Y., Cheng, X., Lin, X.: Core maintenance for hypergraph streams. World Wide Web 26(5), 3709\u20133733 (2023). https:\/\/doi.org\/10.1007\/s11280-023-01196-6","journal-title":"World Wide Web"},{"key":"1347_CR33","doi-asserted-by":"publisher","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Efficient reinforcement of bipartite networks at billion scale. In: ICDE, pp. 446\u2013458 (2022). https:\/\/doi.org\/10.1109\/ICDE53745.2022.00038","DOI":"10.1109\/ICDE53745.2022.00038"},{"key":"1347_CR34","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_8","DOI":"10.1007\/978-3-540-68279-0_8"},{"key":"1347_CR35","doi-asserted-by":"crossref","unstructured":"Silva, W.R., Marco\u00a0J\u00fanior, P.d., Hasui, \u00c9., Gomes, V.S.: Patterns of fruit-frugivore interactions in two atlantic forest bird communities of south-eastern brazil: implications for conservation. In: Third International Symposium-Workshop on Frugivores and Seed Dispersal, pp. 423\u2013435 (2002)","DOI":"10.1079\/9780851995250.0423"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01347-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-025-01347-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01347-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:13:01Z","timestamp":1747807981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-025-01347-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1347"],"URL":"https:\/\/doi.org\/10.1007\/s11280-025-01347-x","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2025,5]]},"assertion":[{"value":"22 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 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":"This declaration is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"34"}}