{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T13:31:20Z","timestamp":1769347880375,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation","doi-asserted-by":"crossref","award":["U1905211"],"award-info":[{"award-number":["U1905211"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00607-022-01125-x","type":"journal-article","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T19:02:46Z","timestamp":1666119766000},"page":"275-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Influence maximization based on SATS scheme in social networks"],"prefix":"10.1007","volume":"105","author":[{"given":"Xinxin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaobin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"1125_CR1","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, 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"issue":"1","key":"1125_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301286","volume":"52","author":"R Bian","year":"2019","unstructured":"Bian R, Koh YS, Doebbie G, Divoli A (2019) Identifying top-k nodes in social networks: a survey. ACM Comput Surv 52(1):1\u201333","journal-title":"ACM Comput Surv"},{"issue":"10","key":"1125_CR3","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Sellis T, Xia F (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1125_CR4","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD conference on knowledge discovery and data mining, 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1125_CR5","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"1125_CR6","doi-asserted-by":"crossref","unstructured":"Yi X, Han Y, Wang X (2013) The evaluation of online social network\u2019s nodes influence based on user\u2019s attribute and behavior. Internet Conference of China (ICoC2013), 9\u201320","DOI":"10.1007\/978-3-642-53959-6_2"},{"issue":"2","key":"1125_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3409108","volume":"15","author":"Q Gong","year":"2021","unstructured":"Gong Q, Chen Y, He X, Xiao Y, Hui P, Wang X, Fu X (2021) Cross-site prediction on social influence for cold-start users in online social networks. ACM Trans Web (TWEB) 15(2):1\u201323","journal-title":"ACM Trans Web (TWEB)"},{"issue":"11","key":"1125_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.3390\/a13110280","volume":"13","author":"J Sheng","year":"2020","unstructured":"Sheng J, Zhu J, Wang Y, Wang B, Hou Z (2020) Identifying influential nodes of complex networks based on trust-value. Algorithms 13(11):280\u2013295","journal-title":"Algorithms"},{"issue":"9","key":"1125_CR9","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DD (2020) A survey on influence maximization in a social network. Knowl Inform Syst 62(9):3417\u20133455","journal-title":"Knowl Inform Syst"},{"key":"1125_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ins.2019.04.033","volume":"493","author":"A Zareie","year":"2019","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2019) Identification of influential users in social networks based on users\u2019 interest,. Inform Sci 493:217\u2013231","journal-title":"Inform Sci"},{"key":"1125_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.neucom.2021.04.084","volume":"453","author":"AK Singh","year":"2021","unstructured":"Singh AK, Kailasam L (2021) Link prediction-based influence maximization in online social networks. Neurocomputing 453:151\u2013163","journal-title":"Neurocomputing"},{"key":"1125_CR12","doi-asserted-by":"publisher","first-page":"100393","DOI":"10.1016\/j.cosrev.2021.100393","volume":"40","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi M, Mnasri W, Romdhane LB (2021) New trends in influence maximization models. Comput Sci Rev 40:100393","journal-title":"Comput Sci Rev"},{"issue":"7","key":"1125_CR13","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1007\/s10489-018-01398-w","volume":"49","author":"X Rui","year":"2019","unstructured":"Rui X, Meng F, Wang Z, Yuan G (2019) A reversed node ranking approach for influence maximization in social networks. Appl Intell 49(7):2684\u20132698","journal-title":"Appl Intell"},{"issue":"3","key":"1125_CR14","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Discov 25(3):545\u2013576","journal-title":"Data Min Knowl Discov"},{"key":"1125_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford"},{"key":"1125_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.ins.2020.07.061","volume":"546","author":"Y Wang","year":"2021","unstructured":"Wang Y, Wang J, Wang H, Zhang R, Li M (2021) Users\u2019 mobility enhances information diffusion in online social networks. Inform Sci 546:329\u2013346","journal-title":"Inform Sci"},{"issue":"4","key":"1125_CR17","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen D, Lu L, Shang M, Zhang Y, Zhou T (2012) Identifying influential nodes in complex networks. Phys A: Stat Mech Appl 391(4):1777\u20131787","journal-title":"Phys A: Stat Mech Appl"},{"issue":"1","key":"1125_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-04978-z","volume":"9","author":"A Kirkley","year":"2018","unstructured":"Kirkley A, Barbosa H, Barthelemy M, Ghoshal G (2018) From the betweenness centrality in street networks to structural invariants in random planar graphs. Nature Commun 9(1):1\u201312","journal-title":"Nature Commun"},{"issue":"3","key":"1125_CR19","first-page":"251","volume":"26","author":"V Aytac","year":"2018","unstructured":"Aytac V, Turac T (2018) Closeness centrality in some splitting networks. Comput Sci J Moldova 26(3):251\u2013269","journal-title":"Comput Sci J Moldova"},{"issue":"11","key":"1125_CR20","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos L, Havlin S, Liljeros F, Muchnik L, Stanley E, Makse H (2010) Identification of influential spreaders in complex networks. Nature Phys 6(11):888\u2013893","journal-title":"Nature Phys"},{"issue":"1","key":"1125_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10115-018-1240-8","volume":"61","author":"M Saleem","year":"2019","unstructured":"Saleem M, Kumar R, Calders T (2019) Effective and efficient location influence mining in location-based social networks. Knowl Inform Syst 61(1):327\u2013362","journal-title":"Knowl Inform Syst"},{"issue":"1","key":"1125_CR22","first-page":"1","volume":"9","author":"L Page","year":"1998","unstructured":"Page L (1998) The PageRank citation ranking: bringing order to the web,. Stanf Digit Libr Work Paper 9(1):1\u201314","journal-title":"Stanf Digit Libr Work Paper"},{"key":"1125_CR23","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, Liu X (2016) Identifying social influence in complex networks: a novel conductance eigenvector centrality model. Neurocomputing 210:141\u2013154","journal-title":"Neurocomputing"},{"issue":"6","key":"1125_CR24","doi-asserted-by":"publisher","first-page":"21202","DOI":"10.1371\/journal.pone.0021202","volume":"6","author":"L Lu","year":"2011","unstructured":"Lu L, Zhang Y, Yeung C, Zhou T (2011) Leaders in social networks, the delicious case. PLOS One 6(6):21202\u201321213","journal-title":"PLOS One"},{"issue":"5","key":"1125_CR25","first-page":"604","volume":"46","author":"J Kleinberg","year":"1999","unstructured":"Kleinberg J (1999) Authoritative sources in a hyberlinked environment. Struct Dyn Netw 46(5):604\u2013632","journal-title":"Struct Dyn Netw"},{"key":"1125_CR26","doi-asserted-by":"publisher","DOI":"10.4159\/9780674029095","volume-title":"Structure Holes: The Social Structure of Competition","author":"R Burt","year":"1992","unstructured":"Burt R (1992) Structure Holes: The Social Structure of Competition. Havard University Press, Cambridge"},{"key":"1125_CR27","doi-asserted-by":"crossref","unstructured":"Lin Z, Zhang Y, Gong Q, Chen Y, Oksanen A, YiDing A(2022) Structural hole theory in social network analysis: a review. IEEE Trans Comput Soc Syst 9(3):724\u2013739","DOI":"10.1109\/TCSS.2021.3070321"},{"key":"1125_CR28","first-page":"1","volume":"99","author":"F Jafarzadehpour","year":"2019","unstructured":"Jafarzadehpour F, Molahosseini A, Zarandi A, Sousa L (2019) Efficient modular adder designs based on thermometer and one-hot coding. IEEE Trans Very Large Scale Integr Syst 99:1\u201314","journal-title":"IEEE Trans Very Large Scale Integr Syst"},{"key":"1125_CR29","doi-asserted-by":"publisher","first-page":"43330","DOI":"10.1038\/srep43330","volume":"7","author":"D Liu","year":"2017","unstructured":"Liu D, Jing Y, Zhao J, Wang W, Song G (2017) A fast and efficient algorithm for mining top-k nodes in complex networks. Sci Rep 7:43330","journal-title":"Sci Rep"},{"key":"1125_CR30","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.jpdc.2017.09.007","volume":"120","author":"G Zhang","year":"2018","unstructured":"Zhang G, Cheng S, Shu J, Hu Q, Zheng W (2018) Accelerating breadth-first graph search on a single server by dynamic edge trimming. J Parallel Distrib Comput 120:383\u2013394","journal-title":"J Parallel Distrib Comput"},{"key":"1125_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W Zachary","year":"1977","unstructured":"Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452\u2013473","journal-title":"J Anthropol Res"},{"key":"1125_CR32","doi-asserted-by":"crossref","unstructured":"Xu Q, Qiu L, Lin R, Tang Y, He C, Yuan C (2021) \u201cAn improved community detection algorithm via fusing topology and attribute information. In: Proceedings of the 2021 IEEE 24th international conference on computer supported cooperative work in design","DOI":"10.1109\/CSCWD49262.2021.9437681"},{"key":"1125_CR33","unstructured":"Ryan A, Nesreen K (2015) \u201cThe network data repository with interactive graph analytics and visualization,\u201d http:\/\/networkrepository.com,"},{"key":"1125_CR34","doi-asserted-by":"crossref","unstructured":"Cho E, Myers S, Leskovec J (2011) \u201cFriendship and mobility: user movement in location-based social networks. In: ACM SIGKDD international conference on knowledge discovery and data mining (KDD), San Diego, pp. 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"issue":"3","key":"1125_CR35","doi-asserted-by":"publisher","first-page":"036122","DOI":"10.1103\/PhysRevE.71.036122","volume":"71","author":"I Vragovic","year":"2005","unstructured":"Vragovic I, Louis E, Diaz G (2005) Efficiency of informational transfer in regular and complex networks. Phys Rev E 71(3):036122","journal-title":"Phys Rev E"},{"issue":"6","key":"1125_CR36","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1088\/1367-2630\/9\/6\/188","volume":"9","author":"V Latora","year":"2007","unstructured":"Latora V, Marchiori M (2007) A measure of centrality based on network efficiency. New J Phys 9(6):188","journal-title":"New J Phys"},{"issue":"1","key":"1125_CR37","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1214\/11-AOP697","volume":"41","author":"S Dereich","year":"2013","unstructured":"Dereich S, Morters P (2013) Random networks with sublinear preferential attachment: the giant component. Ann Probab 41(1):329\u2013384","journal-title":"Ann Probab"},{"key":"1125_CR38","doi-asserted-by":"crossref","unstructured":"Bedenknecht W, Mota G, Reiher C, Schacht M (2017) On the local density problem for graphs of given odd-girth. Electr Notes Discrete Math, 62:39\u201344","DOI":"10.1016\/j.endm.2017.10.008"},{"issue":"2","key":"1125_CR39","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"B Ulrik","year":"2001","unstructured":"Ulrik B (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177","journal-title":"J Math Sociol"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01125-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01125-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01125-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T16:14:17Z","timestamp":1675181657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01125-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1125"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01125-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,18]]},"assertion":[{"value":"20 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}