{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:37:02Z","timestamp":1770741422588,"version":"3.49.0"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006115","name":"Institute for Research in Fundamental Sciences","doi-asserted-by":"publisher","award":["CS1398-4-222"],"award-info":[{"award-number":["CS1398-4-222"]}],"id":[{"id":"10.13039\/501100006115","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11227-020-03355-2","type":"journal-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T11:02:43Z","timestamp":1591441363000},"page":"2207-2236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["CFIN: A community-based algorithm for finding influential nodes in complex social networks"],"prefix":"10.1007","volume":"77","author":[{"given":"Mohammad Mehdi Daliri","family":"Khomami","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3323-7832","authenticated-orcid":false,"given":"Alireza","family":"Rezvanian","sequence":"additional","affiliation":[]},{"given":"Mohammad Reza","family":"Meybodi","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Bagheri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,6]]},"reference":[{"key":"3355_CR1","doi-asserted-by":"publisher","first-page":"5402","DOI":"10.1007\/s11227-017-2092-9","volume":"73","author":"S Alrashed","year":"2017","unstructured":"Alrashed S (2017) Reducing power consumption of non-preemptive real-time systems. J Supercomput 73:5402\u20135413. https:\/\/doi.org\/10.1007\/s11227-017-2092-9","journal-title":"J Supercomput"},{"key":"3355_CR2","doi-asserted-by":"publisher","first-page":"101523","DOI":"10.1016\/j.scs.2019.101523","volume":"48","author":"N Min-Allah","year":"2019","unstructured":"Min-Allah N, Qureshi MB, Alrashed S, Rana OF (2019) Cost efficient resource allocation for real-time tasks in embedded systems. Sustain Cities Soc 48:101523. https:\/\/doi.org\/10.1016\/j.scs.2019.101523","journal-title":"Sustain Cities Soc"},{"key":"3355_CR3","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"3355_CR4","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"3355_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1201\/b17231-3","volume":"37","author":"H Zhang","year":"2014","unstructured":"Zhang H, Mishra S, Thai MT et al (2014) Recent advances in information diffusion and influence maximization in complex social networks. Oppor Mob Soc Netw 37:37","journal-title":"Oppor Mob Soc Netw"},{"key":"3355_CR6","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web. ACM, pp 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"key":"3355_CR7","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","volume":"123","author":"P Wu","year":"2017","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350","journal-title":"Comput Netw"},{"key":"3355_CR8","doi-asserted-by":"crossref","unstructured":"Feng Z, Xu X, Yuruk N, Schweiger TA (2007) A novel similarity-based modularity function for graph partitioning. In: International Conference on Data Warehousing and Knowledge Discovery. Springer, pp 385\u2013396","DOI":"10.1007\/978-3-540-74553-2_36"},{"key":"3355_CR9","doi-asserted-by":"crossref","unstructured":"Teng YW TC, Yu PS, Chen MS (2018) Revenue maximization on the multi-grade product. In: Proceedings of the 2018 SIAM International Conference on Data Mining, pp 576\u2013584","DOI":"10.1137\/1.9781611975321.65"},{"key":"3355_CR10","doi-asserted-by":"crossref","unstructured":"Ma H, Yang H, Lyu MR, King I (2008) Mining social networks using heat diffusion processes for marketing candidates selection. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management. ACM, pp 233\u2013242","DOI":"10.1145\/1458082.1458115"},{"key":"3355_CR11","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s10489-017-0987-z","volume":"48","author":"MMD Khomami","year":"2018","unstructured":"Khomami MMD, Rezvanian A, Bagherpour N, Meybodi MR (2018) Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl Intell 48:570\u2013593","journal-title":"Appl Intell"},{"key":"3355_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-030-10767-3_9","volume-title":"Learning automata approach for social networks","author":"A Rezvanian","year":"2019","unstructured":"Rezvanian A, Moradabadi B, Ghavipour M et al (2019) Social Influence Maximization. In: Rezvanian A, Moradabadi B, Ghavipour M et al (eds) Learning automata approach for social networks. Springer International Publishing, Cham, pp 315\u2013329"},{"key":"3355_CR13","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3355_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C et al (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"3355_CR15","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf\u2009++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"3355_CR16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ins.2015.04.024","volume":"316","author":"S Kundu","year":"2015","unstructured":"Kundu S, Pal SK (2015) Deprecation based greedy strategy for target set selection in large scale social networks. Inf Sci 316:107\u2013122","journal-title":"Inf Sci"},{"key":"3355_CR17","doi-asserted-by":"crossref","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng 27:2770\u20132783","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3355_CR18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TKDE.2016.2620141","volume":"29","author":"G Song","year":"2016","unstructured":"Song G, Li Y, Chen X et al (2016) Influential node tracking on dynamic social network: an interchange greedy approach. IEEE Trans Knowl Data Eng 29:359\u2013372","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3355_CR19","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"3355_CR20","doi-asserted-by":"crossref","unstructured":"Guo J, Zhang P, Zhou C et al (2013) Item-based top-k influential user discovery in social networks. In: 2013 IEEE 13th International Conference on Data Mining Workshops. IEEE, pp 780\u2013787","DOI":"10.1109\/ICDMW.2013.144"},{"key":"3355_CR21","doi-asserted-by":"crossref","first-page":"68005","DOI":"10.1209\/0295-5075\/108\/68005","volume":"108","author":"X-Y Zhao","year":"2015","unstructured":"Zhao X-Y, Huang B, Tang M et al (2015) Identifying effective multiple spreaders by coloring complex networks. EPL Europhys Lett 108:68005","journal-title":"EPL Europhys Lett"},{"key":"3355_CR22","unstructured":"Kim J, Kim S-K, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks? In: 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, pp 266\u2013277"},{"key":"3355_CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.knosys.2014.02.013","volume":"62","author":"J Kim","year":"2014","unstructured":"Kim J, Lee W, Yu H (2014) CT-IC: continuously activated and time-restricted independent cascade model for viral marketing. Knowl Based Syst 62:57\u201368","journal-title":"Knowl Based Syst"},{"key":"3355_CR24","doi-asserted-by":"crossref","first-page":"e102199","DOI":"10.1371\/journal.pone.0102199","volume":"9","author":"D Li","year":"2014","unstructured":"Li D, Xu Z-M, Chakraborty N et al (2014) Polarity related influence maximization in signed social networks. PLoS ONE 9:e102199","journal-title":"PLoS ONE"},{"key":"3355_CR25","doi-asserted-by":"crossref","unstructured":"Luo Z-L, Cai W-D, Li Y-J, Peng D (2012) A pagerank-based heuristic algorithm for influence maximization in the social network. In: Recent Progress in Data Engineering and Internet Technology. Springer, pp 485\u2013490","DOI":"10.1007\/978-3-642-28798-5_65"},{"key":"3355_CR26","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/s10618-009-0150-5","volume":"20","author":"M Kimura","year":"2010","unstructured":"Kimura M, Saito K, Nakano R, Motoda H (2010) Extracting influential nodes on a social network for information diffusion. Data Min Knowl Discov 20:70","journal-title":"Data Min Knowl Discov"},{"key":"3355_CR27","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K (2014) Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: Twenty-Eighth AAAI Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"3355_CR28","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining (ICDM). IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"3355_CR29","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE International Conference on Data Mining. IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"3355_CR30","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/s40649-014-0002-3","volume":"1","author":"Z Lu","year":"2014","unstructured":"Lu Z, Fan L, Wu W et al (2014) Efficient influence spread estimation for influence maximization under the linear threshold model. Comput Soc Netw 1:2","journal-title":"Comput Soc Netw"},{"key":"3355_CR31","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.physa.2014.10.088","volume":"420","author":"M Heidari","year":"2015","unstructured":"Heidari M, Asadpour M, Faili H (2015) SMG: fast scalable greedy algorithm for influence maximization in social networks. Phys Stat Mech Appl 420:124\u2013133","journal-title":"Phys Stat Mech Appl"},{"key":"3355_CR32","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8:130\u2013147","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"3355_CR33","doi-asserted-by":"crossref","first-page":"042306","DOI":"10.1103\/PhysRevE.99.042306","volume":"99","author":"GT Cantwell","year":"2019","unstructured":"Cantwell GT, Newman MEJ (2019) Mixing patterns and individual differences in networks. Phys Rev E 99:042306","journal-title":"Phys Rev E"},{"key":"3355_CR34","doi-asserted-by":"crossref","first-page":"032310","DOI":"10.1103\/PhysRevE.96.032310","volume":"96","author":"MA Riolo","year":"2017","unstructured":"Riolo MA, Cantwell GT, Reinert G, Newman ME (2017) Efficient method for estimating the number of communities in a network. Phys Rev E 96:032310","journal-title":"Phys Rev E"},{"key":"3355_CR35","doi-asserted-by":"crossref","first-page":"5739","DOI":"10.1038\/srep05739","volume":"4","author":"W Liu","year":"2014","unstructured":"Liu W, Pellegrini M, Wang X (2014) Detecting communities based on network topology. Sci Rep 4:5739","journal-title":"Sci Rep"},{"key":"3355_CR36","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li H, Bhowmick SS, Sun A, Cui J (2015) Conformity-aware influence maximization in online social networks. VLDB J 24:117\u2013141","journal-title":"VLDB J"},{"key":"3355_CR37","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TKDE.2016.2621038","volume":"29","author":"L Guo","year":"2016","unstructured":"Guo L, Zhang D, Cong G et al (2016) Influence maximization in trajectory databases. IEEE Trans Knowl Data Eng 29:627\u2013641","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3355_CR38","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang D, Tan K-L (2015) Real-time targeted influence maximization for online advertisements","DOI":"10.14778\/2794367.2794376"},{"key":"3355_CR39","unstructured":"Stein S, Eshghi S, Maghsudi S et al (2017) Heuristic algorithms for influence maximization in partially observable social networks. In: SocInf@ IJCAI, pp 20\u201332"},{"key":"3355_CR40","doi-asserted-by":"crossref","unstructured":"Wilder B, Immorlica N, Rice E, Tambe M (2018) Maximizing influence in an unknown social network. In: Thirty-Second AAAI Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v32i1.11585"},{"key":"3355_CR41","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-030-10767-3_5","volume-title":"Learning automata approach for social networks","author":"A Rezvanian","year":"2019","unstructured":"Rezvanian A, Moradabadi B, Ghavipour M et al (2019) Social Community Detection. Learning automata approach for social networks. Springer International Publishing, Cham, pp 151\u2013168"},{"key":"3355_CR42","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1016\/j.physa.2018.04.006","volume":"505","author":"Bagnato G de Guzzi","year":"2018","unstructured":"de Guzzi Bagnato G, Ronqui JRF, Travieso G (2018) Community detection in networks using self-avoiding random walks. Phys Stat Mech Appl 505:1046\u20131055","journal-title":"Phys Stat Mech Appl"},{"key":"3355_CR43","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486:75\u2013174","journal-title":"Phys Rep"},{"key":"3355_CR44","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros FD, Vazirgiannis M (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533:95\u2013142. https:\/\/doi.org\/10.1016\/j.physrep.2013.08.002","journal-title":"Phys Rep"},{"issue":"2","key":"3355_CR45","doi-asserted-by":"crossref","first-page":"026109","DOI":"10.1103\/PhysRevE.78.026109","volume":"78","author":"JM Kumpula","year":"2008","unstructured":"Kumpula JM, Kivel\u00e4 M, Kaski K, Saram\u00e4ki J (2008) Sequential algorithm for fast clique percolation. Phys Rev E 78(2):026109","journal-title":"Phys Rev E"},{"issue":"1","key":"3355_CR46","first-page":"47","volume":"33","author":"Z-G Luo","year":"2011","unstructured":"Luo Z-G, Ding F, Jiang X-Z, Shi J-L (2011) New progress on community detection in complex networks. J Nat Univ Defense Technol 33(1):47\u201352","journal-title":"J Nat Univ Defense Technol"},{"issue":"7043","key":"3355_CR47","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"key":"3355_CR48","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106","journal-title":"Phys Rev E"},{"key":"3355_CR49","doi-asserted-by":"crossref","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12:103018","journal-title":"New J Phys"},{"key":"3355_CR50","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK (2012) Towards linear time overlapping community detection in social networks. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, pp 25\u201336","DOI":"10.1007\/978-3-642-30220-6_3"},{"key":"3355_CR51","doi-asserted-by":"crossref","unstructured":"Ugander J, Backstrom L (2013) Balanced label propagation for partitioning massive graphs. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp 507\u2013516","DOI":"10.1145\/2433396.2433461"},{"key":"3355_CR52","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1186\/1471-2164-15-282","volume":"15","author":"ME Stokes","year":"2014","unstructured":"Stokes ME, Barmada MM, Kamboh MI, Visweswaran S (2014) The application of network label propagation to rank biomarkers in genome-wide Alzheimer\u2019s data. BMC Genom 15:282","journal-title":"BMC Genom"},{"key":"3355_CR53","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1049\/trit.2019.0040","volume":"5","author":"R Hosseini","year":"2020","unstructured":"Hosseini R, Rezvanian A (2020) AntLP: ant-based label propagation algorithm for community detection in social networks. CAAI Trans Intell Technol 5:34\u201341","journal-title":"CAAI Trans Intell Technol"},{"key":"3355_CR54","doi-asserted-by":"crossref","unstructured":"Kuzmin K, Shah SY, Szymanski BK (2013) Parallel overlapping community detection with SLPA. In: 2013 International Conference on Social Computing. IEEE, pp 204\u2013212","DOI":"10.1109\/SocialCom.2013.37"},{"key":"3355_CR55","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y-Y Ahn","year":"2010","unstructured":"Ahn Y-Y, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466:761\u2013764","journal-title":"Nature"},{"key":"3355_CR56","doi-asserted-by":"crossref","unstructured":"Ye Q, Wu B, Zhao Z, Wang B (2011) Detecting link communities in massive networks. In: 2011 International Conference on Advances in Social Networks Analysis and Mining. IEEE, pp 71\u201378","DOI":"10.1109\/ASONAM.2011.53"},{"key":"3355_CR57","unstructured":"Lee C, Reid F, McDaid A, Hurley N (2010) Detecting highly overlapping community structure by greedy clique expansion. ArXiv Prepr ArXiv10021827"},{"key":"3355_CR58","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TCSS.2017.2749282","volume":"4","author":"X Zhang","year":"2017","unstructured":"Zhang X, Wang C, Su Y et al (2017) A fast overlapping community detection algorithm based on weak cliques for large-scale networks. IEEE Trans Comput Soc Syst 4:218\u2013230","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"3355_CR59","doi-asserted-by":"crossref","first-page":"5231","DOI":"10.1016\/j.physa.2013.06.056","volume":"392","author":"R Badie","year":"2013","unstructured":"Badie R, Aleahmad A, Asadpour M, Rahgozar M (2013) An efficient agent-based algorithm for overlapping community detection using nodes\u2019 closeness. Phys Stat Mech Appl 392:5231\u20135247","journal-title":"Phys Stat Mech Appl"},{"key":"3355_CR60","doi-asserted-by":"crossref","first-page":"1650042","DOI":"10.1142\/S0217979216500429","volume":"30","author":"MMD Khomami","year":"2016","unstructured":"Khomami MMD, Rezvanian A, Meybodi MR (2016) Distributed learning automata-based algorithm for community detection in complex networks. Int J Mod Phys B 30:1650042","journal-title":"Int J Mod Phys B"},{"key":"3355_CR61","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99:7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"3355_CR62","doi-asserted-by":"crossref","first-page":"S186","DOI":"10.1098\/rsbl.2003.0057","volume":"270","author":"D Lusseau","year":"2003","unstructured":"Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond B Biol Sci 270:S186\u2013S188","journal-title":"Proc R Soc Lond B Biol Sci"},{"key":"3355_CR63","doi-asserted-by":"crossref","first-page":"P10014","DOI":"10.1088\/1742-5468\/2005\/10\/P10014","volume":"2005","author":"J Park","year":"2005","unstructured":"Park J, Newman ME (2005) A network-based ranking system for US college football. J Stat Mech: Theory Exp 2005:P10014","journal-title":"J Stat Mech: Theory Exp"},{"key":"3355_CR64","doi-asserted-by":"crossref","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery. ACM, pp 36\u201343","DOI":"10.1145\/1134271.1134277"},{"key":"3355_CR65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1217299.1217300","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data TKDD 1:1\u201341","journal-title":"ACM Trans Knowl Discov Data TKDD"},{"key":"3355_CR66","doi-asserted-by":"crossref","unstructured":"Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: International Semantic Web Conference. Springer, pp 351\u2013368","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"3355_CR67","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17\u201361","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"3355_CR68","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"3355_CR69","doi-asserted-by":"crossref","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","volume":"6","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2011) Finding statistically significant communities in networks. PLoS ONE 6:e18961","journal-title":"PLoS ONE"},{"key":"3355_CR70","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2011) A data-based approach to social influence maximization. Proc VLDB Endow 5:73\u201384","journal-title":"Proc VLDB Endow"},{"key":"3355_CR71","first-page":"25","volume":"5","author":"Y-C Chen","year":"2014","unstructured":"Chen Y-C, Zhu W-Y, Peng W-C et al (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol TIST 5:25","journal-title":"ACM Trans Intell Syst Technol TIST"},{"key":"3355_CR72","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","volume":"42","author":"K Rahimkhani","year":"2015","unstructured":"Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42:1353\u20131361","journal-title":"Expert Syst Appl"},{"key":"3355_CR73","doi-asserted-by":"crossref","unstructured":"Ok J, Jin Y, Shin J, Yi Y (2014) On maximizing diffusion speed in social networks: impact of random seeding and clustering. In: The 2014 ACM International Conference on Measurement and Modeling of Computer Systems, pp 301\u2013313","DOI":"10.1145\/2637364.2591991"},{"issue":"12","key":"3355_CR74","doi-asserted-by":"publisher","first-page":"e0145283","DOI":"10.1371\/journal.pone.0145283","volume":"10","author":"J-L He","year":"2015","unstructured":"He J-L, Fu Y, Chen D-B (2015) A novel top-k strategy for influence maximization in complex networks with community structure. PLOS ONE 10(12):e0145283. https:\/\/doi.org\/10.1371\/journal.pone.0145283","journal-title":"PLOS ONE"},{"key":"3355_CR75","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03355-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03355-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03355-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T22:24:15Z","timestamp":1666823055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03355-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,6]]},"references-count":75,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3355"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03355-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,6]]},"assertion":[{"value":"6 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}