{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:38:19Z","timestamp":1770752299910,"version":"3.50.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030908874","type":"print"},{"value":"9783030908881","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90888-1_35","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:13:49Z","timestamp":1638454429000},"page":"453-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Critical Nodes Identification in Large Networks: An Inclination-Based Model"],"prefix":"10.1007","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xijuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shuangyan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Mengqi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"3","key":"35_CR1","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)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR2","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":"35_CR3","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":"35_CR4","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":"35_CR5","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 J. (2021)","DOI":"10.1007\/s11280-021-00914-2"},{"key":"35_CR6","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":"35_CR7","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. Inf. Comput. 247, 11\u201322 (2016)","journal-title":"Inf. Comput."},{"key":"35_CR8","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":"35_CR9","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National security agency technical report (2008)"},{"issue":"11","key":"35_CR10","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"key":"35_CR11","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"},{"key":"35_CR12","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"},{"key":"35_CR13","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"},{"issue":"3","key":"35_CR14","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":"35_CR15","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 J. (2021)","DOI":"10.1007\/s11280-021-00904-4"},{"key":"35_CR16","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":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-030-59416-9_43","volume-title":"Database Systems for Advanced Applications","author":"R Sun","year":"2020","unstructured":"Sun, R., Zhu, Q., Chen, C., Wang, X., Zhang, Y., Wang, X.: Discovering cliques in signed networks based on balance theory. In: Nah, Y., Cui, B., Lee, S.-W., Yu, J.X., Moon, Y.-S., Whang, S.E. (eds.) DASFAA 2020. LNCS, vol. 12113, pp. 666\u2013674. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59416-9_43"},{"issue":"16","key":"35_CR18","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. Proc. Natl. Acad. Sci. 109(16), 5962\u20135966 (2012)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6","key":"35_CR19","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. Nat. Biotechnol. 21(6), 697\u2013700 (2003)","journal-title":"Nat. Biotechnol."},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Wu, S., Das Sarma, A., Fabrikant, A., Lattanzi, S., Tomkins, A.: Arrival and departure dynamics in social networks. In: International Conference on Web Search and Data Mining, pp. 233\u2013242 (2013)","DOI":"10.1145\/2433396.2433425"},{"issue":"6","key":"35_CR21","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":"35_CR22","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":"35_CR23","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":"35_CR24","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Zhang, F., Lin, X., Zhang, W., Chen, C.: K-core maximization: an edge addition approach. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/676"},{"key":"35_CR25","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":"35_CR26","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":"35_CR27","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":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90888-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T23:14:17Z","timestamp":1673910857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90888-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908874","9783030908881"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90888-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"229","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}