{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:41:07Z","timestamp":1777610467503,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002073"],"award-info":[{"award-number":["62002073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Basic and Applied Basic Research Foundation","award":["202102020675"],"award-info":[{"award-number":["202102020675"]}]}],"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-00905-3","type":"journal-article","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:40Z","timestamp":1624100620000},"page":"679-701","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Discovering key users for defending network structural stability"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0548-0130","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiadong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,19]]},"reference":[{"key":"905_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M. G. C., Sudarsky, S.: Massive quasi-clique detection. In: LATIN, pp. 598\u2013612 (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"key":"905_CR2","unstructured":"Alvarez-Hamelin, J. I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NeurIPS, pp. 41\u201350 (2005)"},{"issue":"2","key":"905_CR3","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3934\/nhm.2008.3.371","volume":"3","author":"JI Alvarez-Hamelin","year":"2008","unstructured":"Alvarez-Hamelin, J. I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Networks Heterog. Media 3(2), 371\u2013393 (2008). https:\/\/doi.org\/10.3934\/nhm.2008.3.371","journal-title":"Networks Heterog. Media"},{"key":"905_CR4","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks CoRR cs.DS\/0310049 (2003)"},{"issue":"3","key":"905_CR5","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J. M., 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)","journal-title":"SIAM J. Discrete Math."},{"key":"905_CR6","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.neuroimage.2015.03.057","volume":"114","author":"M Bola","year":"2015","unstructured":"Bola, M., Sabel, B. A.: Dynamic reorganization of brain functional networks during cognition. Neuroimage 114, 398\u2013413 (2015)","journal-title":"Neuroimage"},{"key":"905_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Khan, A., Severini, L.: Distance-generalized core decomposition. In: SIGMOD, pp. 1006\u20131023 (2019)","DOI":"10.1145\/3299869.3324962"},{"issue":"9","key":"905_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"issue":"27","key":"905_CR9","doi-asserted-by":"publisher","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E.: A model of internet topology using k-shell decomposition. Proc. Natl. Acad. Sci. 104 (27), 11150\u201311154 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"905_CR10","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J. X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"905_CR11","doi-asserted-by":"publisher","unstructured":"Chen, L., Liu, C., Liao, K., Li, J., Zhou, R.: Contextual community search over large social networks. In: ICDE. https:\/\/doi.org\/10.1109\/ICDE.2019.00017, pp 88\u201399. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00017"},{"key":"905_CR12","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Fu, A. W., Yu, J. X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: SIGMOD, pp. 447\u2013458 (2010)","DOI":"10.1145\/1807167.1807217"},{"key":"905_CR13","doi-asserted-by":"publisher","unstructured":"Chu, D., Zhang, F., Lin, X., Zhang, W., Zhang, Y., Xia, Y., Zhang, C.: Finding the best k in core decomposition: A time and space optimal solution. In: ICDE. https:\/\/doi.org\/10.1109\/ICDE48307.2020.00065, pp 685\u2013696 (2020)","DOI":"10.1109\/ICDE48307.2020.00065"},{"issue":"1","key":"905_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/1467-937X.00118","volume":"67","author":"MSY Chwe","year":"2000","unstructured":"Chwe, M. S. Y.: Communication and coordination in social networks. Rev. Econ. Stud. 67(1), 1\u201316 (2000)","journal-title":"Rev. Econ. Stud."},{"key":"905_CR15","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National Security Agency Technical Report, p. 16 (2008)"},{"issue":"4","key":"905_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1089\/brain.2012.0137","volume":"3","author":"M Daianu","year":"2013","unstructured":"Daianu, M., Jahanshad, N., Nir, T.M., Toga, A.W., Jack Jr., C.R., Weiner, M.W., Thompson, P.M.: Breakdown of brain connectivity between normal aging and alzheimer\u2019s disease: A structural k-core network analysis. Brain Connect. 3(4), 407\u2013422 (2013). https:\/\/doi.org\/10.1089\/brain.2012.0137","journal-title":"Brain Connect."},{"issue":"2","key":"905_CR17","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/1513876.1513879","volume":"3","author":"Y Dourisboure","year":"2009","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense implicit communities in the web graph. TWEB 3(2), 7:1\u20137:36 (2009)","journal-title":"TWEB"},{"key":"905_CR18","unstructured":"Elsharkawy, S., Hassan, G., Nabhan, T., Roushdy, M.: Effectiveness of the k-core nodes as seeds for influence maximisation in dynamic cascades. Int. J. Comput., p. 2 (2017)"},{"issue":"6","key":"905_CR19","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"key":"905_CR20","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, D., Mavrodiev, P., Schweitzer, F.: Social resilience in online communities: the autopsy of friendster. In: Conference on Online Social Networks, pp. 39\u201350 (2013)","DOI":"10.1145\/2512938.2512946"},{"key":"905_CR21","doi-asserted-by":"crossref","unstructured":"Ghafouri, M., Wang, K., Zhang, F., Zhang, Y., Lin, X.: Efficient graph hierarchical decomposition with user engagement and tie strength. In: DASFAA, pp. 448\u2013465 (2020)","DOI":"10.1007\/978-3-030-59416-9_27"},{"key":"905_CR22","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Malliaros, F. D., Thilikos, D. M., Vazirgiannis, M.: Corecluster: A degeneracy based graph clustering framework. In: AAAI, pp. 44\u201350 (2014)","DOI":"10.1609\/aaai.v28i1.8731"},{"key":"905_CR23","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J. X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"11","key":"905_CR24","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L. K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H. E., Makse, H. A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888 (2010)","journal-title":"Nat. Phys."},{"key":"905_CR25","doi-asserted-by":"crossref","unstructured":"Li, R., Qin, L., Ye, F., Yu, J. X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: SIGMOD, pp. 457\u2013472 (2018)","DOI":"10.1145\/3183713.3183736"},{"issue":"45","key":"905_CR26","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1016\/j.physleta.2014.09.054","volume":"378","author":"JH Lin","year":"2014","unstructured":"Lin, J. H., Guo, Q., Dong, W. Z., Tang, L. Y., Liu, J. G.: Identifying the node spreading influence with largest k-core values. Phys. Lett. A 378(45), 3279\u20133284 (2014)","journal-title":"Phys. Lett. A"},{"key":"905_CR27","doi-asserted-by":"publisher","unstructured":"Lin, Z., Zhang, F., Lin, X., Zhang, W., Tian, Z.: Hierarchical core maintenance on large dynamic graphs. https:\/\/doi.org\/10.14778\/3446095.3446099, vol. 14, pp 757\u2013770 (2021)","DOI":"10.14778\/3446095.3446099"},{"key":"905_CR28","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: Maier, D., Pottinger, R., Doan, A., Tan, W., Alawini, A., Ngo, H.Q. (eds.) SIGMOD. https:\/\/doi.org\/10.1145\/3318464.3389744, pp 2211\u20132226. ACM (2020)","DOI":"10.1145\/3318464.3389744"},{"key":"905_CR29","doi-asserted-by":"publisher","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (a, \u03b2)-core computation: an index-based approach. In: Liu, L., White, R.W., Mantrach, A., Silvestri, F., McAuley, J.J., Baeza-Yates, R., Zia, L. (eds.) WWW. https:\/\/doi.org\/10.1145\/3308558.3313522, pp 1130\u20131141. ACM (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"905_CR30","doi-asserted-by":"publisher","unstructured":"Liu, B., Zhang, F., Zhang, C., Zhang, W., Lin, X.: Corecube: Core decomposition in multilayer graphs. In: WISE. https:\/\/doi.org\/10.1007\/978-3-030-34223-4_44, pp 694\u2013710 (2019)","DOI":"10.1007\/978-3-030-34223-4_44"},{"key":"905_CR31","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, W., Lin, X., Zhang, Y.: Efficient community search with size constraint. In: ICDE (2021)","DOI":"10.1109\/ICDE51399.2021.00016"},{"key":"905_CR32","doi-asserted-by":"publisher","first-page":"19307","DOI":"10.1038\/srep19307","volume":"6","author":"FD Malliaros","year":"2016","unstructured":"Malliaros, F. D., Rossi, M. E. G., Vazirgiannis, M.: Locating influential nodes in complex networks. Scientific Reports 6, 19307 (2016)","journal-title":"Scientific Reports"},{"key":"905_CR33","doi-asserted-by":"crossref","unstructured":"Malliaros, F. D., Vazirgiannis, M.: To stay or not to stay: modeling engagement dynamics in social graphs. In: CIKM, pp. 469\u2013478 (2013)","DOI":"10.1145\/2505515.2505561"},{"issue":"3","key":"905_CR34","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D. W., Beck, L. L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"905_CR35","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., Pellegrini, F. D., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"905_CR36","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 (2019)","journal-title":"Nat. Phys."},{"issue":"3","key":"905_CR37","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. Social Networks 5(3), 269\u2013287 (1983)","journal-title":"Social Networks"},{"issue":"1","key":"905_CR38","first-page":"10:1","volume":"7","author":"K Seki","year":"2017","unstructured":"Seki, K., Nakamura, M.: The mechanism of collapse of the friendster network: What can we learn from the core structure of friendster? Social Netw. Analys. Mining 7(1), 10:1\u201310:21 (2017)","journal-title":"Social Netw. Analys. Mining"},{"issue":"9","key":"905_CR39","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"key":"905_CR40","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: ICDE, pp. 233\u2013244 (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"905_CR41","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s00778-021-00658-5"},{"key":"905_CR42","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: ICDE. IEEE (2021)","DOI":"10.1145\/3459637.3482282"},{"issue":"4","key":"905_CR43","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41019-017-0051-3","volume":"2","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Jian, X., Yang, Z., Li, J.: Query optimal k-plex based community in graphs. Data Sci. Eng. 2(4), 257\u2013273 (2017). https:\/\/doi.org\/10.1007\/s41019-017-0051-3","journal-title":"Data Sci. Eng."},{"key":"905_CR44","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J. X.: I\/O efficient core graph decomposition at web scale. In: ICDE, pp. 133\u2013144 (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"905_CR45","doi-asserted-by":"publisher","unstructured":"Zhang, C., Zhang, F., Zhang, W., Liu, B., Zhang, Y., Qin, L., Lin, X.: Exploring finer granularity within the cores: Efficient (k, p)-core computation. In: ICDE, pp. 181\u2013192. https:\/\/doi.org\/10.1109\/ICDE48307.2020.00023 (2020)","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"905_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, F., Yuan, L., Zhang, Y., Qin, L., Lin, X., Zhou, A.: Discovering strong communities with user engagement and tie strength. In: DASFAA, pp 425\u2013441. Springer (2018)","DOI":"10.1007\/978-3-319-91452-7_28"},{"key":"905_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Finding critical users for social network engagement: The collapsed k-core problem. In: AAAI, pp. 245\u2013251 (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"issue":"10","key":"905_CR48","first-page":"998","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: Efficient (k, r)-core computation on social networks. PVLDB 10(10), 998\u20131009 (2017)","journal-title":"PVLDB"},{"key":"905_CR49","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Yu, J. X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: ICDE, pp. 337\u2013348. https:\/\/doi.org\/10.1109\/ICDE.2017.93(2017)","DOI":"10.1109\/ICDE.2017.93"},{"issue":"2","key":"905_CR50","first-page":"85","volume":"6","author":"F Zhao","year":"2012","unstructured":"Zhao, F., Tung, A. K. H.: Large scale cohesive subgraphs discovery for social network visual analysis. PVLDB 6(2), 85\u201396 (2012)","journal-title":"PVLDB"},{"key":"905_CR51","doi-asserted-by":"crossref","unstructured":"Zhou, R., Liu, C., Yu, J. X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: EDBT, pp. 480\u2013491 (2012)","DOI":"10.1145\/2247596.2247652"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00905-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00905-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00905-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T19:18:13Z","timestamp":1672514293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00905-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,19]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["905"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00905-3","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,19]]},"assertion":[{"value":"21 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}