{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:47Z","timestamp":1740109247718,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"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":[[2024,11]]},"DOI":"10.1007\/s00778-024-00871-y","type":"journal-article","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T13:02:42Z","timestamp":1724504562000},"page":"1861-1886","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering critical vertices for reinforcement of large-scale bipartite networks"],"prefix":"10.1007","volume":"33","author":[{"given":"Yizhang","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3123-2184","authenticated-orcid":false,"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"871_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A.\u00a0Batagelj, V.,\u00a0Fu, X., Hong, S.-H., Merrick, D., Mrvar, A.: Visualisation and analysis of the internet movie database. In: 2007 6th International Asia-Pacific Symposium on Visualization. IEEE (2007)","DOI":"10.1109\/APVIS.2007.329304"},{"key":"871_CR2","doi-asserted-by":"crossref","unstructured":"Bascompte, J., Jordano, P.: Plant-animal mutualistic networks: the architecture of biodiversity. Annu. Rev. Ecol. Evol. Syst., 38 (2007)","DOI":"10.1146\/annurev.ecolsys.38.091206.095818"},{"key":"871_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"871_CR4","doi-asserted-by":"crossref","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) 2015","DOI":"10.1137\/14097032X"},{"key":"871_CR5","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: International Conference on Machine Learning, pp. 498\u2013507. PMLR (2017)"},{"key":"871_CR6","doi-asserted-by":"crossref","unstructured":"Cai, T., Li, J., Haldar, N.A.H., Mian, A., Yearwood, J., Sellis, T.: Anchored vertex exploration for community engagement in social networks. In: ICDE, pp. 409\u2013420. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00042"},{"key":"871_CR7","doi-asserted-by":"crossref","unstructured":"Cerulli, M., Serra, D., Sorgente, C., Archetti, C., Ljubic, I.: Mathematical programming formulations for the collapsed k-core problem. arXiv preprint arXiv:2211.14833 (2022)","DOI":"10.1016\/j.ejor.2023.04.038"},{"key":"871_CR8","doi-asserted-by":"crossref","unstructured":"Cerulli, M., Serra, D., Sorgente, C., Archetti, C., Ljubi\u0107, I.: Mathematical programming formulations for the collapsed k-core problem. Eur. J. Oper. Res. (2023)","DOI":"10.1016\/j.ejor.2023.04.038"},{"key":"871_CR9","doi-asserted-by":"crossref","unstructured":"Chen, C., Zhu, Q., Sun, R., Wang, X., Wu, Y.: Edge manipulation approaches for k-core minimization: metrics and analytics. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3085570"},{"key":"871_CR10","doi-asserted-by":"crossref","unstructured":"Chen, C., Zhu, Q., Wu, Y., Sun, R., Wang, X., Liu, X.: Efficient critical relationships identification in bipartite networks. World Wide Web, pp. 1\u201321 (2021)","DOI":"10.1007\/s11280-021-00914-2"},{"key":"871_CR11","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. In: Proceedings of the VLDB Endowment (2021)","DOI":"10.14778\/3467861.3467873"},{"key":"871_CR12","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv preprint arXiv:1102.3975 (2011)"},{"key":"871_CR13","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. ACM, In: CIKM (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"871_CR14","doi-asserted-by":"crossref","unstructured":"Fang, Y., Wang, K., Lin, X., Zhang, W.: Cohesive subgraph search over big heterogeneous information networks: applications, challenges, and solutions. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2829\u20132838 (2021)","DOI":"10.1145\/3448016.3457538"},{"key":"871_CR15","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. JACM 45(4) (1998)","DOI":"10.1145\/285055.285059"},{"issue":"2","key":"871_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.3390\/biology10020114","volume":"10","author":"EA Ferreira","year":"2021","unstructured":"Ferreira, E.A., Boff, S., Verza, S.S., Mussury, R.M.: Bioecological and behavioral interaction between pollinating bees and the pioneer shrub ludwigia nervosa in degraded area suggests an exotic bee as its major pollinator. Biology 10(2), 114 (2021)","journal-title":"Biology"},{"key":"871_CR17","doi-asserted-by":"crossref","unstructured":"Garcia, D., Mavrodiev, P., Schweitzer, F.: Social resilience in online communities: the autopsy of friendster. In: Proceedings of the first ACM Conference on Online Social Networks, pp. 39\u201350 (2013)","DOI":"10.1145\/2512938.2512946"},{"key":"871_CR18","doi-asserted-by":"crossref","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Efficient reinforcement of bipartite networks at billion scale. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 446\u2013458. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00038"},{"key":"871_CR19","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1038\/srep01219","volume":"3","author":"X Huang","year":"2013","unstructured":"Huang, X., Vodenska, I., Havlin, S., Stanley, H.E.: Cascading failures in bi-partite graphs: model for systemic risk propagation. Sci. Rep. 3, 1219 (2013)","journal-title":"Sci. Rep."},{"key":"871_CR20","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1608","key":"871_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1098\/rspb.2006.3721","volume":"274","author":"A-M Klein","year":"2007","unstructured":"Klein, A.-M., Vaissiere, B.E., Cane, J.H., Steffan-Dewenter, I., Cunningham, S.A., Kremen, C., Tscharntke, T.: Importance of pollinators in changing landscapes for world crops. Proc. R Soc. B Biol. Sci. 274(1608), 303\u2013313 (2007)","journal-title":"Proc. R Soc. B Biol. Sci."},{"key":"871_CR22","doi-asserted-by":"crossref","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: SIAM, pp. 325\u2013333. SIAM (2020)","DOI":"10.1137\/1.9781611976236.37"},{"issue":"10","key":"871_CR23","first-page":"37","volume":"3","author":"C Landry","year":"2010","unstructured":"Landry, C.: Mighty mutualisms: the nature of plant-pollinator interactions. Nat. Educ. Knowl. 3(10), 37 (2010)","journal-title":"Nat. Educ. Knowl."},{"key":"871_CR24","unstructured":"Lawrence, N., Seeger, M., Herbrich, R.: Fast sparse gaussian process methods: the informative vector machine. Adv. Neural Inf. Process. Syst., 15 (2002)"},{"issue":"5","key":"871_CR25","first-page":"757","volume":"14","author":"Z Lin","year":"2021","unstructured":"Lin, Z., Zhang, F., Lin, X., Zhang, W., Tian, Z.: Hierarchical core maintenance on large dynamic graphs. PVLDB 14(5), 757\u2013770 (2021)","journal-title":"PVLDB"},{"key":"871_CR26","doi-asserted-by":"crossref","unstructured":"Linghu, Q., Zhang, F., Lin, X., Zhang, W., Zhang, Y.: Global reinforcement of social networks: The anchored coreness problem. In: SIGMOD (2020)","DOI":"10.1145\/3318464.3389744"},{"key":"871_CR27","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 (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"21","key":"871_CR28","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1016\/j.physleta.2019.05.012","volume":"383","author":"H Liu","year":"2019","unstructured":"Liu, H., Yang, N., Yang, Z., Zhang, Y., Lin, J.: Modeling and simulations of the cascading failure of multiple interdependent r &d networks under risk propagation. Phys. Lett. A 383(21), 2443\u20132450 (2019)","journal-title":"Phys. Lett. A"},{"key":"871_CR29","doi-asserted-by":"crossref","unstructured":"Liu, K., Wang, S., Zhang, Y., Xing, C.: An efficient algorithm for the anchored k-core budget minimization problem. In: ICDE, pp. 1356\u20131367. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00121"},{"key":"871_CR30","first-page":"2018","volume":"1\u201313","author":"S Liu","year":"2018","unstructured":"Liu, S.: User modeling for point-of-interest recommendations in location-based social networks: the state of the art. Mobile Inf. Syst. 1\u201313, 2018 (2018)","journal-title":"Mobile Inf. Syst."},{"key":"871_CR31","doi-asserted-by":"crossref","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.: From competition to complementarity: comparative influence diffusion and maximization. Proceedings of the VLDB Endowment, 9(2) (2015)","DOI":"10.14778\/2850578.2850581"},{"issue":"8","key":"871_CR32","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1007\/s00224-021-10045-w","volume":"65","author":"J Luo","year":"2021","unstructured":"Luo, J., Molter, H., Such\u1ef3, O.: A parameterized complexity view on collapsing k-cores. Theory Comput. Syst. 65(8), 1243\u20131282 (2021)","journal-title":"Theory Comput. Syst."},{"key":"871_CR33","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J. Maximum biclique search at billion scale. PVLDB, 13(9) (2020)","DOI":"10.14778\/3397230.3397234"},{"key":"871_CR34","doi-asserted-by":"crossref","unstructured":"Malliaros, F.\u00a0D., Vazirgiannis, M.: To stay or not to stay: modeling engagement dynamics in social graphs. In: CIKM (2013)","DOI":"10.1145\/2505515.2505561"},{"key":"871_CR35","doi-asserted-by":"crossref","unstructured":"Medya, S., Ma, T., Silva, A., Singh, A.: K-core minimization: a game theoretic approach. arXiv preprint arXiv:1901.02166, (2019)","DOI":"10.24963\/ijcai.2020\/480"},{"key":"871_CR36","doi-asserted-by":"crossref","unstructured":"Medya, S., Ma, T., Silva, A., Singh, A.: A game theoretic approach for k-core minimization. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (2020)","DOI":"10.24963\/ijcai.2020\/480"},{"issue":"1","key":"871_CR37","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1038\/s41567-018-0304-8","volume":"15","author":"F Morone","year":"2019","unstructured":"Morone, F., Del Ferraro, G., Makse, H.A.: The k-core as a predictor of structural collapse in mutualistic ecosystems. Nat. Phys. 15(1), 95\u2013102 (2019)","journal-title":"Nat. Phys."},{"key":"871_CR38","unstructured":"O\u2019Connor, C.M., Adams, J.U., Fairman, J.: Essentials of Cell Biology. NPG Education, Cambridge, MA, 1, 54 (2010)"},{"key":"871_CR39","doi-asserted-by":"crossref","unstructured":"Pavlopoulos, G.\u00a0A., Kontou, P.\u00a0I., Pavlopoulou, A., Bouyioukos, C., Markou, E., Bagos, P.\u00a0G.: Bipartite graphs in systems biology and medicine: a survey of methods and applications. Gigascience, 7(4):giy014 (2018)","DOI":"10.1093\/gigascience\/giy014"},{"issue":"4","key":"871_CR40","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/j.1095-8339.1992.tb00294.x","volume":"110","author":"N Ramirez","year":"1992","unstructured":"Ramirez, N., Brito, Y.: Pollination biology in a palm swamp community in the venezuelan central plains. Botanical J. Linnean Soc. 110(4), 277\u2013302 (1992)","journal-title":"Botanical J. Linnean Soc."},{"issue":"3","key":"871_CR41","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"871_CR42","doi-asserted-by":"crossref","unstructured":"Seki, K., Nakamura, M.: The collapse of the friendster network started from the center of the core. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 477\u2013484. IEEE (2016)","DOI":"10.1109\/ASONAM.2016.7752278"},{"key":"871_CR43","first-page":"214","volume":"34","author":"K Sun","year":"2020","unstructured":"Sun, K., Qian, T., Chen, T., Liang, Y., Nguyen, Q.V.H., Yin, H.: Where to go next: modeling long-and short-term user preferences for point-of-interest recommendation. Proc. AAAI Conf. Artif. Intell. 34, 214\u2013221 (2020)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"871_CR44","doi-asserted-by":"crossref","unstructured":"Wang, J., De\u00a0Vries, A.\u00a0P., Reinders, M.\u00a0J.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: SIGIR, pp. 501\u2013508. ACM (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"871_CR45","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. IEEE, In: ICDE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"871_CR46","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), pages 85\u201396. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00015"},{"issue":"3","key":"871_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2523068","volume":"5","author":"JJ-C Ying","year":"2014","unstructured":"Ying, J.J.-C., Kuo, W.-N., Tseng, V.S., Lu, E.H.-C.: Mining user check-in behavior with a random walk for urban point-of-interest recommendations. ACM Trans. Intell. Syst. Technol. (TIST) 5(3), 1\u201326 (2014)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"871_CR48","doi-asserted-by":"crossref","unstructured":"Zhang, F., Li, C., Zhang, Y., Qin, L., Zhang, W.: Finding critical users in social communities: The collapsed core and truss problems. TKDE (2018)","DOI":"10.1609\/aaai.v31i1.10482"},{"issue":"2","key":"871_CR49","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)","journal-title":"World Wide Web"},{"key":"871_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: Olak: an efficient algorithm to prevent unraveling in social networks. PVLDB, 10(6), ( 2017)","DOI":"10.14778\/3055330.3055332"},{"key":"871_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, F., \u00a0Zhang, Y., \u00a0Qin, L., \u00a0Zhang, W., \u00a0Lin, X.: Finding critical users for social network engagement: the collapsed k-core problem. In: AAAI, (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"871_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, F., \u00a0Zhang, Y., \u00a0Qin, L., \u00a0Zhang, W., \u00a0Lin, X.: Efficiently reinforcing social networks over user engagement and tie strength. In: ICDE, pp. 557\u2013568. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00057"},{"key":"871_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, S., \u00a0Cheng, H.: Exploiting context graph attention for POI recommendation in location-based social networks. In J.\u00a0Pei, Y.\u00a0Manolopoulos, S.\u00a0W. Sadiq, and J.\u00a0Li, (Eds.) DASFAA 2018, pp. 83\u201399. Springer (2018)","DOI":"10.1007\/978-3-319-91452-7_6"},{"key":"871_CR54","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.\u00a0X., \u00a0Zhang, Y., \u00a0Qin, L.: A fast order-based approach for core maintenance. In:ICDE, pp. 337\u2013348. IEEE (2017)","DOI":"10.1109\/ICDE.2017.93"},{"key":"871_CR55","doi-asserted-by":"crossref","unstructured":"Zhou, B., \u00a0Lv, Y., \u00a0Wang, J., \u00a0Zhang, J., \u00a0Xuan, Q.: Attacking the core structure of complex network. IEEE Trans. Comput. Soc. Syst. (2022)","DOI":"10.1109\/TCSS.2022.3188522"},{"key":"871_CR56","doi-asserted-by":"crossref","unstructured":"Zhou, Z., \u00a0Zhang, F., \u00a0Lin, X., \u00a0Zhang, W., \u00a0Chen, C.: K-core maximization: an edge addition approach. In: IJCAI, pp. 4867\u20134873. AAAI Press (2019)","DOI":"10.24963\/ijcai.2019\/676"},{"key":"871_CR57","doi-asserted-by":"crossref","unstructured":"Zhu, W., \u00a0Chen, C., \u00a0Wang, X., \u00a0Lin, X.: K-core minimization: an edge manipulation approach. In: CIKM, pp. 1667\u20131670 (2018)","DOI":"10.1145\/3269206.3269254"},{"key":"871_CR58","doi-asserted-by":"crossref","unstructured":"Zhu, W., \u00a0Zhang, M., \u00a0Chen, C., \u00a0Wang, X., \u00a0Zhang, F., \u00a0Lin, X.: Pivotal relationship identification: the k-truss minimization problem. In: IJCAI, pp. 4874\u20134880 (2019)","DOI":"10.24963\/ijcai.2019\/677"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00871-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00871-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00871-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T10:10:33Z","timestamp":1729505433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00871-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":58,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00871-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"24 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}