{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:14:13Z","timestamp":1768338853100,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030688837","type":"print"},{"value":"9783030688844","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":"http:\/\/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":"http:\/\/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-68884-4_39","type":"book-chapter","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T23:29:09Z","timestamp":1612826949000},"page":"467-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Critical Node Detection Algorithm Based Node Interplay Model"],"prefix":"10.1007","author":[{"given":"Lingxiao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xuefeng","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-24907-6_26","volume-title":"Security, Privacy, and Anonymity in Computation, Communication, and Storage","author":"M Peters","year":"2019","unstructured":"Peters, M., Goltz, J., Wiedenmann, S., Mundt, T.: Using machine learning to find anomalies in field bus network traffic. In: Wang, G., Feng, J., Bhuiyan, M.Z.A., Lu, R. (eds.) SpaCCS 2019. LNCS, vol. 11611, pp. 336\u2013353. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24907-6_26"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-24907-6_11","volume-title":"Security, Privacy, and Anonymity in Computation, Communication, and Storage","author":"F Schillinger","year":"2019","unstructured":"Schillinger, F., Schindelhauer, C.: End-to-end encryption schemes for online social networks. In: Wang, G., Feng, J., Bhuiyan, M.Z.A., Lu, R. (eds.) SpaCCS 2019. LNCS, vol. 11611, pp. 133\u2013146. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24907-6_11"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-05345-1_33","volume-title":"Security, Privacy, and Anonymity in Computation, Communication, and Storage","author":"K Majbouri Yazdi","year":"2018","unstructured":"Majbouri Yazdi, K., Yazdi, A.M., Khodayi, S., Hou, J., Zhou, W., Saedy, S.: Integrating ant colony algorithm and node centrality to improve prediction of information diffusion in social networks. In: Wang, G., Chen, J., Yang, L.T. (eds.) SpaCCS 2018. LNCS, vol. 11342, pp. 381\u2013391. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05345-1_33"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.physa.2017.12.087","volume":"496","author":"C Salavati","year":"2018","unstructured":"Salavati, C., Abdollahpouri, A., Manbari, Z.: BridgeRank: a novel fast centrality measure based on local structure of the network. Phys. A 496, 635\u2013653 (2018)","journal-title":"Phys. A"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.micpro.2017.08.002","volume":"54","author":"M Fazlali","year":"2017","unstructured":"Fazlali, M., Moradi, E., Malazi, T.: Adaptive parallel Louvain community detection on a multicore platform. Microprocess. Microsyst. 54, 26\u201334 (2017)","journal-title":"Microprocess. Microsyst."},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2015","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Disc. 30(2), 438\u2013475 (2015). https:\/\/doi.org\/10.1007\/s10618-015-0423-0","journal-title":"Data Min. Knowl. Disc."},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.neucom.2018.04.086","volume":"336","author":"C Salavati","year":"2019","unstructured":"Salavati, C., Abdollahpouri, A., Manbari, Z.: Ranking nodes in complex networks based on local structure and improving closeness centrality. Neurocomputing. 336, 36\u201345 (2019)","journal-title":"Neurocomputing."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.physa.2017.11.138","volume":"492","author":"L Liu","year":"2018","unstructured":"Liu, L., Ma, C., Xiang, B., et al.: Identifying multiple influential spreaders based on generalized closeness centrality. Phys. A 492, 2237\u20132248 (2018)","journal-title":"Phys. A"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.physa.2018.07.031","volume":"511","author":"F Zhong","year":"2018","unstructured":"Zhong, F., Liu, H., Wang, W., et al.: Comprehensive influence of local and global characteristics on identifying the influential nodes. Phys. A 511, 78\u201384 (2018)","journal-title":"Phys. A"},{"issue":"1","key":"39_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0493-2","volume":"8","author":"K Das","year":"2018","unstructured":"Das, K., Samanta, S., Pal, M.: Study on centrality measures in social networks: a survey. Soc. Netw. Anal. Min. 8(1), 1\u201311 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0493-2","journal-title":"Soc. Netw. Anal. Min."},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.neucom.2015.11.123","volume":"210","author":"X Li","year":"2016","unstructured":"Li, X., Liu, Y., Jiang, Y., et al.: Identifying social influence in complex networks: a novel conductance eigenvector centrality model. Neurocomputing. 210, 141\u2013154 (2016)","journal-title":"Neurocomputing."},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.physa.2018.08.135","volume":"512","author":"L Fei","year":"2018","unstructured":"Fei, L., Zhang, Q., Deng, Y.: Identifying influential nodes in complex networks based on the inverse-square law. Phys. A 512, 1044\u20131059 (2018)","journal-title":"Phys. A"},{"issue":"3","key":"39_CR14","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.joule.2017.08.021","volume":"1","author":"H Dave","year":"2017","unstructured":"Dave, H., Keller, D., Golmer, K., et al.: Six degrees of separation: connecting research with users and cost analysis. Joule. 1(3), 410\u2013415 (2017)","journal-title":"Joule."},{"issue":"2\u20133","key":"39_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2\u20133), 161\u2013180 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"3\u20134","key":"39_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.physa.2003.12.035","volume":"336","author":"J Satsuma","year":"2004","unstructured":"Satsuma, J., Willox, R., Ramani, A., et al.: Extending the SIR epidemic model. Phys. A 336(3\u20134), 369\u2013375 (2004)","journal-title":"Phys. A"},{"issue":"6833","key":"39_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, P., Barab\u00e1si, L., et al.: Lethality and centrality in protein networks. Nature 411(6833), 41 (2001)","journal-title":"Nature"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data. 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data."},{"issue":"5","key":"39_CR19","doi-asserted-by":"publisher","first-page":"056122","DOI":"10.1103\/PhysRevE.70.056122","volume":"70","author":"M Bogun\u00e1","year":"2004","unstructured":"Bogun\u00e1, M., Pastor-Satorras, R., D\u00edaz-Guilera, A., et al.: Models of social networks based on social distance attachment. Phys. Rev. E. 70(5), 056122 (2004)","journal-title":"Phys. Rev. E."},{"issue":"1","key":"39_CR20","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E. 80(1), 016118 (2009)","journal-title":"Phys. Rev. E."}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Anonymity in Computation, Communication, and Storage"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68884-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T23:49:04Z","timestamp":1612828144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68884-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688837","9783030688844"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68884-4_39","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":"7 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SpaCCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spaccs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.spaccs2020.com\/","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":"131","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":"48","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":"0","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":"37% - 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)"}}]}}