{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:29:09Z","timestamp":1758126549617,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11280-022-01049-8","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T10:03:56Z","timestamp":1650881036000},"page":"1315-1341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Critical Nodes Identification in Large Networks: The Inclined and Detached Models"],"prefix":"10.1007","volume":"25","author":[{"given":"Renjie","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3908-6545","authenticated-orcid":false,"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xijuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangyan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"1049_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR (2003)"},{"issue":"3","key":"1049_CR2","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 Journal on Discrete Mathematics 29(3), 1452\u20131475 (2015)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1049_CR3","doi-asserted-by":"crossref","unstructured":"Burke, M., Marlow, C., Lento, T.: Feed me: motivating newcomer contribution in social network sites. In: SIGCHI, pp. 945\u2013954 (2009)","DOI":"10.1145\/1518701.1518847"},{"key":"1049_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Liu, X., Xu, S., Zhang, M., Wang, X., Lin, X.: Critical nodes identification in large networks: An inclination-based model. In: WISE, pp. 453\u2013468 (2021)","DOI":"10.1007\/978-3-030-90888-1_35"},{"key":"1049_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$\\theta$$-clique identification in large signed graphs. TKDE (2021)","DOI":"10.1109\/TKDE.2021.3098423"},{"key":"1049_CR6","unstructured":"Chen, C., Zhang, M., Sun, R., Wang, X., Zhu, W., Wang, X.: Locating pivotal connections: The k-truss minimization and maximization problems. WWW Journal pp. 1\u201328 (2021)"},{"key":"1049_CR7","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. TKDE (2021)","DOI":"10.1109\/TKDE.2021.3085570"},{"key":"1049_CR8","doi-asserted-by":"crossref","unstructured":"Chen, C., Zhu, Q., Wu, Y., Sun, R., Wang, X., Liu, X.: Efficient critical relationships identification in bipartite networks. WWW Journal (2021)","DOI":"10.1007\/s11280-021-00914-2"},{"key":"1049_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., Conte, A., Grossi, R., Loukides, G., Pissis, S.P., Sweering, M.: On breaking truss-based communities. In: KDD, pp. 117\u2013126 (2021)","DOI":"10.1145\/3447548.3467365"},{"key":"1049_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, D., Chen, C., Wang, X., Xiang, S.: Efficient top-k vulnerable nodes detection in uncertain graphs. TKDE (2021)","DOI":"10.1109\/TKDE.2021.3094549"},{"key":"1049_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ic.2015.11.002","volume":"247","author":"R Chitnis","year":"2016","unstructured":"Chitnis, R., Fomin, F.V., Golovach, P.A.: Parameterized complexity of the anchored k-core problem for directed graphs. Information and Computation 247, 11\u201322 (2016)","journal-title":"Information and Computation"},{"key":"1049_CR12","doi-asserted-by":"crossref","unstructured":"Chitnis, R.H., Fomin, F.V., Golovach, P.A.: Preventing unraveling in social networks gets harder. In: AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8462"},{"key":"1049_CR13","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National security agency technical report (2008)"},{"key":"1049_CR14","doi-asserted-by":"crossref","unstructured":"He, J., Rong, J., Sun, L., Wang, H., Zhang, Y., Ma, J.: A framework for cardiac arrhythmia detection from IoT-based ECGs. World Wide Web 23(5), 2835\u20132850 (2020)\u00a0","DOI":"10.1007\/s11280-019-00776-9"},{"key":"1049_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations, pp. 85\u2013103. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"11","key":"1049_CR16","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. Nature physics 6(11), 888\u2013893 (2010)","journal-title":"Nature physics"},{"key":"1049_CR17","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 (2021)","DOI":"10.1109\/ICDE51399.2021.00121"},{"key":"1049_CR18","doi-asserted-by":"crossref","unstructured":"Medya, S., Ma, T., Silva, A., Singh, A.: A game theoretic approach for core resilience. In: IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/480"},{"key":"1049_CR19","doi-asserted-by":"crossref","unstructured":"Medya, S., Ma, T., Silva, A., Singh, A.: A game theoretic approach for k-core minimization. In: International Conference on Autonomous Agents and MultiAgent Systems (2020)","DOI":"10.24963\/ijcai.2020\/480"},{"issue":"3","key":"1049_CR20","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"},{"key":"1049_CR21","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Wu, Y., Zhang, M., Liu, X.: The art of characterization in large networks: Finding the critical attributes. WWW Journal (2021)","DOI":"10.1007\/s11280-021-00904-4"},{"key":"1049_CR22","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. TKDE (2020)","DOI":"10.1109\/TKDE.2020.3047224"},{"key":"1049_CR23","doi-asserted-by":"crossref","unstructured":"Sun, R., Zhu, Q., Chen, C., Wang, X., Zhang, Y., Wang, X.: Discovering cliques in signed networks based on balance theory. In: DASFAA (2020)","DOI":"10.1007\/978-3-030-59416-9_43"},{"key":"1049_CR24","doi-asserted-by":"crossref","unstructured":"Tawhid, Md. N.A., Siuly S., Wang, K., Wang, H.: Data mining based artificial intelligent technique for identifying abnormalities from brain signal data: WISE, 198\u2013206 (2021)\u00a0","DOI":"10.1007\/978-3-030-90888-1_16"},{"issue":"16","key":"1049_CR25","doi-asserted-by":"publisher","first-page":"5962","DOI":"10.1073\/pnas.1116502109","volume":"109","author":"J Ugander","year":"2012","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. Proceedings of the National Academy of Sciences 109(16), 5962\u20135966 (2012)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6","key":"1049_CR26","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1038\/nbt825","volume":"21","author":"A Vazquez","year":"2003","unstructured":"Vazquez, A., Flammini, A., Maritan, A., Vespignani, A.: Global protein function prediction from protein-protein interaction networks. Nature biotechnology 21(6), 697\u2013700 (2003)","journal-title":"Nature biotechnology"},{"key":"1049_CR27","doi-asserted-by":"crossref","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: A novel scalable method for influence maximization. IEEE Transactions on Knowledge and Data Engineering 29(2), 243\u2013256 (2016)","DOI":"10.1109\/TKDE.2016.2624734"},{"issue":"6","key":"1049_CR28","first-page":"649","volume":"10","author":"F Zhang","year":"2017","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)","journal-title":"PVLDB"},{"key":"1049_CR29","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 (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"1049_CR30","doi-asserted-by":"crossref","unstructured":"Zhao, J., Sun, R., Zhu, Q., Wang, X., Chen, C.: Community identification in signed networks: a k-truss based model. In: CIKM (2020)","DOI":"10.1145\/3340531.3412117"},{"key":"1049_CR31","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Zheng, J., Yang, H., Chen, C., Wang, X., Zhang, Y.: Hurricane in bipartite graphs: The lethal nodes of butterflies. In: SSDBM (2020)","DOI":"10.1145\/3400903.3400916"},{"key":"1049_CR32","doi-asserted-by":"crossref","unstructured":"Zhu, W., Chen, C., Wang, X., Lin, X.: K-core minimization: An edge manipulation approach. In: CIKM, pp. 1667\u20131670 (2018)","DOI":"10.1145\/3269206.3269254"},{"key":"1049_CR33","doi-asserted-by":"crossref","unstructured":"Zhu, W., Zhang, M., Chen, C., Wang, X., Zhang, F., Lin, X.: Pivotal relationship identification: The k-truss minimization problem. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/677"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01049-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-022-01049-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01049-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T09:40:53Z","timestamp":1675417253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-022-01049-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1049"],"URL":"https:\/\/doi.org\/10.1007\/s11280-022-01049-8","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"10 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2022","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}