{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:19:30Z","timestamp":1761621570818,"version":"3.40.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10489-021-02203-x","type":"journal-article","created":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T11:02:49Z","timestamp":1615201369000},"page":"7365-7383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Parallel social behavior-based algorithm for identification of influential users in social network"],"prefix":"10.1007","volume":"51","author":[{"given":"Wassim","family":"Mnasri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4960-916X","authenticated-orcid":false,"given":"Mehdi","family":"Azaouzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lotfi Ben","family":"Romdhane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"2203_CR1","doi-asserted-by":"publisher","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 (KDD\u201901). Association for Computing Machinery, New York, pp 57\u201366, https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"key":"2203_CR2","doi-asserted-by":"publisher","unstructured":"Jurado F, Delgado O, Ortigosa \u00c1 (2020) Tracking News Stories Using Blockchain to Guarantee their Traceability and Information Analysis. Int J Interact Multim Artif Intell 6(3):39\u201346. https:\/\/doi.org\/10.9781\/ijimai.2020.06.003","DOI":"10.9781\/ijimai.2020.06.003"},{"issue":"4","key":"2203_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.9781\/ijimai.2020.10.003","volume":"6","author":"M Jain","year":"2020","unstructured":"Jain M, Jaswani A, Mehra A, Mudgal A (2020) Rumour source detection using game theory. Int J Interact Multim Artif Intell 6(4):49\u201356. https:\/\/doi.org\/10.9781\/ijimai.2020.10.003","journal-title":"Int J Interact Multim Artif Intell"},{"key":"2203_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jnca.2018.01.005","volume":"106","author":"S Peng","year":"2018","unstructured":"Peng S, Zhou Y, Cao L, Yu S, Niu J, Jia W (2018) Influence analysis in social networks: a survey. J Netw Comput Appl 106:17\u201332. https:\/\/doi.org\/10.1016\/j.jnca.2018.01.005","journal-title":"J Netw Comput Appl"},{"key":"2203_CR5","doi-asserted-by":"publisher","unstructured":"Jaouadi M, Romdhane BL (2019) influence maximization problem in social networks: an overview. In: Proceedings of the 2019 IEEE\/ACS 16th International Conference of Computer Systems and Applications, AICCSA. IEEE, Abu Dhabi, pp 1\u20138. https:\/\/doi.org\/10.1109\/AICCSA47632.2019.9035366","DOI":"10.1109\/AICCSA47632.2019.9035366"},{"issue":"C","key":"2203_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.knosys.2017.01.014","volume":"121","author":"S Jendoubi","year":"2017","unstructured":"Jendoubi S, Martin A, Li\u00e9tard L, Hadji H B, Yaghlane B B (2017) Two evidential data based models for influence maximization in twitter. Know-Based Syst 121(C):58\u201370. https:\/\/doi.org\/10.1016\/j.knosys.2017.01.014","journal-title":"Know-Based Syst"},{"key":"2203_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.eswa.2018.05.001","volume":"108","author":"A Zareie","year":"2018","unstructured":"Zareie A, Sheikhahmadi A, Khamforoosh K (2018) Influence maximization in social networks based on topsis. Expert Syst Appl 108:96\u2013107. https:\/\/doi.org\/10.1016\/j.eswa.2018.05.001","journal-title":"Expert Syst Appl"},{"key":"2203_CR8","doi-asserted-by":"publisher","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, (KDD \u201903). Association for Computing Machinery, New York, pp 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"2203_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s11390-018-1820-9","volume":"33","author":"M Azaouzi","year":"2018","unstructured":"Azaouzi M, Ben Romdhane L (2018) An efficient two-phase model for computing influential nodes in social networks using social actions. J Inf Comput Sci 33(2):286\u2013304. https:\/\/doi.org\/10.1007\/s11390-018-1820-9","journal-title":"J Inf Comput Sci"},{"issue":"10","key":"2203_CR10","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, Tan K L (2018b) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872. https:\/\/doi.org\/10.1109\/TKDE.2018.2807843","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2203_CR11","doi-asserted-by":"publisher","first-page":"113642","DOI":"10.1016\/j.eswa.2020.113642","volume":"159","author":"N Hafiene","year":"2020","unstructured":"Hafiene N, Karoui W, Ben Romdhane L (2020) Influential nodes detection in dynamic social networks: a survey. Expert Syst Appl 159:113642. https:\/\/doi.org\/10.1016\/j.eswa.2020.113642","journal-title":"Expert Syst Appl"},{"issue":"C","key":"2203_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.procs.2017.08.045","volume":"112","author":"M Azaouzi","year":"2017","unstructured":"Azaouzi M, Ben Romdhane L (2017) An evidential influence-based label propagation algorithm for distributed community detection in social networks. Procedia Comput Sci 112(C):407\u2013416. https:\/\/doi.org\/10.1016\/j.procs.2017.08.045","journal-title":"Procedia Comput Sci"},{"issue":"13","key":"2203_CR13","doi-asserted-by":"publisher","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","volume":"24","author":"SS Singh","year":"2019","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2019b) Aco-im: maximizing influence in social networks using ant colony optimization. Soft Comput 24(13):10181\u201310203. https:\/\/doi.org\/10.1007\/s00500-019-04533-y","journal-title":"Soft Comput"},{"key":"2203_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.ins.2019.07.043","volume":"503","author":"E G\u00fcney","year":"2019","unstructured":"G\u00fcney E (2019) An efficient linear programming based method for the influence maximization problem in social networks. Inf Sci 503:589\u2013605. https:\/\/doi.org\/10.1016\/j.ins.2019.07.043","journal-title":"Inf Sci"},{"key":"2203_CR15","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ins.2019.10.075","volume":"513","author":"Y Chen","year":"2020","unstructured":"Chen Y, Qu Q, Ying Y, Li H, Shen J (2020) Semantics-aware influence maximization in social networks. Inf Sci 513:442\u2013464. https:\/\/doi.org\/10.1016\/j.ins.2019.10.075","journal-title":"Inf Sci"},{"issue":"2","key":"2203_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10489-019-01506-4","volume":"50","author":"W Liu","year":"2020","unstructured":"Liu W, Chen L, Li S, Chen X, Chen B (2020) An algorithm for influence maximization in competitive social networks with unwanted users. Appl Intell 50(2):417\u2013437. https:\/\/doi.org\/10.1007\/s10489-019-01506-4","journal-title":"Appl Intell"},{"issue":"1","key":"2203_CR17","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/TPDS.2013.41","volume":"25","author":"X Liu","year":"2013","unstructured":"Liu X, Li M, Li S, Peng S, Liao X, Lu X (2013) Imgpu: Gpu-accelerated influence maximization in large-scale social networks. IEEE Trans Parallel distrib Syst 25(1):136\u2013145. https:\/\/doi.org\/10.1109\/TPDS.2013.41","journal-title":"IEEE Trans Parallel distrib Syst"},{"key":"2203_CR18","doi-asserted-by":"publisher","unstructured":"Zong Z, Li B, Hu C (2014) Dirier: Distributed influence maximization in social network. in: 2014 20th IEEE international conference on parallel and distributed systems (ICPADS), Hsinchu, pp 119\u2013125. https:\/\/doi.org\/10.1109\/PADSW.2014.7097799","DOI":"10.1109\/PADSW.2014.7097799"},{"issue":"5","key":"2203_CR19","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","volume":"26","author":"G Song","year":"2015","unstructured":"Song G, Zhou X, Wang Y, Xie K (2015) Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method. IEEE Trans Parallel distrib Syst 26(5):1379\u20131392. https:\/\/doi.org\/10.1109\/TPDS.2014.2320515","journal-title":"IEEE Trans Parallel distrib Syst"},{"key":"2203_CR20","doi-asserted-by":"publisher","unstructured":"Wu H, Yue K, Fu X, Wang Y, Liu W (2016) Parallel seed selection for influence maximization based on k-shell decomposition. In: Wang S., Zhou A (eds) Collaborate computing: networking, Applications and Worksharing. CollaborateCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 201. Springer, Cham, pp 27\u201336. https:\/\/doi.org\/10.1007\/978-3-319-59288-6_3","DOI":"10.1007\/978-3-319-59288-6_3"},{"key":"2203_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ins.2017.06.018","volume":"415","author":"S Kim","year":"2017","unstructured":"Kim S, Kim D, Oh J, Hwang JH, Han WS, Chen W, Yu H (2017) Scalable and parallelizable influence maximization with random walk ranking and rank merge pruning. Inf Sci 415:171\u2013189. https:\/\/doi.org\/10.1016\/j.ins.2017.06.018","journal-title":"Inf Sci"},{"key":"2203_CR22","doi-asserted-by":"publisher","unstructured":"Minutoli M, Drocco M, Halappanavar M, Tumeo A, Kalyanaraman A (2020) curipples: influence maximization on multi-cpu systems. In: Proceedings of the 34th ACM International Conference on Supercomputing (ICS \u201920). Association for Computing Machinery, New York, Article 12, pp 1\u201311. https:\/\/doi.org\/10.1145\/3392717.3392750","DOI":"10.1145\/3392717.3392750"},{"key":"2203_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2019.12.038","volume":"106","author":"L Xiao","year":"2020","unstructured":"Xiao L, Wang S, Mei G (2020) Efficient parallel algorithm for detecting influential nodes in large biological networks on the graphics processing unit. Future Gener Comput Syst 106:1\u201313. https:\/\/doi.org\/10.1016\/j.future.2019.12.038","journal-title":"Future Gener Comput Syst"},{"key":"2203_CR24","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD \u201907). Association for Computing Machinery, New York, pp 420\u2013429. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"2203_CR25","doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web (WWW \u201911). Association for Computing Machinery, New York, pp 47\u201348. https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"key":"2203_CR26","doi-asserted-by":"publisher","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 (SIGMETRICS \u201914). Association for computing machinery, New York, pp 301\u2013313. https:\/\/doi.org\/10.1145\/2591971.2591991","DOI":"10.1145\/2591971.2591991"},{"key":"2203_CR27","doi-asserted-by":"publisher","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. Physica A Stat Mech Appl 420:124\u2013133. https:\/\/doi.org\/10.1016\/j.physa.2014.10.088","journal-title":"Physica A Stat Mech Appl"},{"key":"2203_CR28","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.jocs.2017.10.015","volume":"28","author":"H Li","year":"2018","unstructured":"Li H, Pan L, Wu P (2018a) Dominated competitive influence maximization with time-critical and time-delayed diffusion in social networks. J Comput Sci 28:318\u2013327. https:\/\/doi.org\/10.1016\/j.jocs.2017.10.015","journal-title":"J Comput Sci"},{"issue":"3","key":"2203_CR29","doi-asserted-by":"publisher","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(3):1353\u20131361. https:\/\/doi.org\/10.1016\/j.eswa.2014.09.037","journal-title":"Expert Syst Appl"},{"key":"2203_CR30","doi-asserted-by":"publisher","unstructured":"Jaouadi M, Ben Romdhane L (2016) Din: an efficient algorithm for detecting influential nodes in social graphs using network structure and attributes. In: Proceedings of the 2016 IEEE\/ACS 13th International Conference of Computer Systems and Applications, AICCSA. IEEE, Agadir, pp 1\u20138. https:\/\/doi.org\/10.1109\/AICCSA.2016.7945698","DOI":"10.1109\/AICCSA.2016.7945698"},{"key":"2203_CR31","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88\u2013100. https:\/\/doi.org\/10.1016\/j.knosys.2016.09.029","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2203_CR32","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10489-019-01529-x","volume":"50","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z (2019) Community-based influence maximization in attributed networks. Appl Intell 50(2):354\u2013364. https:\/\/doi.org\/10.1007\/s10489-019-01529-x","journal-title":"Appl Intell"},{"issue":"18","key":"2203_CR33","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin S, Page L (2012) Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825\u20133833. https:\/\/doi.org\/10.1016\/j.comnet.2012.10.007","journal-title":"Comput Netw"},{"issue":"9","key":"2203_CR34","doi-asserted-by":"publisher","first-page":"2286","DOI":"10.1109\/TPDS.2013.135","volume":"25","author":"G Wang","year":"2014","unstructured":"Wang G, Jiang W, Wu J, Xiong Z (2014) Fine-grained feature-based social influence evaluation in online social networks. IEEE Trans Parallel Distrib Syst 25(9):2286\u20132296. https:\/\/doi.org\/10.1109\/TPDS.2013.135","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2203_CR35","doi-asserted-by":"publisher","unstructured":"He P, Wang J, Feng W, Li L (2015) Exploring influential nodes using multi-attribute information. In: 2015 11Th international conference on natural computation (ICNC), Zhangjiajie, pp 473\u2013478. https:\/\/doi.org\/10.1109\/ICNC.2015.7378035","DOI":"10.1109\/ICNC.2015.7378035"},{"key":"2203_CR36","doi-asserted-by":"publisher","unstructured":"Yin X, Hu X, Chen Y, Yuan X, Li B (2019) Signed-pagerank: an efficient influence maximization framework for signed social networks. IEEE Trans Knowl Data Eng PrePrints:1\u20131. https:\/\/doi.org\/10.1109\/TKDE.2019.2947421","DOI":"10.1109\/TKDE.2019.2947421"},{"key":"2203_CR37","doi-asserted-by":"publisher","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 (KDD \u201909). Association for Computing Machinery, New York, pp 199\u2013208. https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"issue":"11","key":"2203_CR38","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley H E, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893. https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nat Phys"},{"key":"2203_CR39","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A Stat Mech Appl 395:549\u2013559. https:\/\/doi.org\/10.1016\/j.physa.2013.10.047","journal-title":"Physica A Stat Mech Appl"},{"key":"2203_CR40","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.physa.2015.04.035","volume":"436","author":"A Sheikhahmadi","year":"2015","unstructured":"Sheikhahmadi A, Nematbakhsh MA, Shokrollahi A (2015) Improving detection of influential nodes in complex networks. Physica A Stat Mech Appl 436:833\u2013845. https:\/\/doi.org\/10.1016\/j.physa.2015.04.035","journal-title":"Physica A Stat Mech Appl"},{"issue":"3","key":"2203_CR41","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1177\/0165551516644171","volume":"43","author":"A Sheikhahmadi","year":"2017","unstructured":"Sheikhahmadi A, Nematbakhsh MA (2017) Identification of multi-spreader users in social networks for viral marketing. J Inf Sci 43(3):412\u2013423. https:\/\/doi.org\/10.1177\/0165551516644171","journal-title":"J Inf Sci"},{"key":"2203_CR42","doi-asserted-by":"publisher","unstructured":"Hafiene N, Karoui W, Ben Romdhane L (2019) Influential Nodes Detection in Dynamic Social Networks. In: Abramowicz W, Corchuelo R (eds) Business Information Systems. BIS 2019. Lecture Notes in Business Information Processing, vol 354. Springer, Cham, pp 62\u201373. https:\/\/doi.org\/10.1007\/978-3-030-20482-2_6","DOI":"10.1007\/978-3-030-20482-2_6"},{"key":"2203_CR43","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1007\/s10489-020-01747-8","volume":"50","author":"W Liu","year":"2020","unstructured":"Liu W, Li Y, Chen X, He J (2020) Maximum likelihood-based influence maximization in social networks. Appl Intell 50:3487\u20133502. https:\/\/doi.org\/10.1007\/s10489-020-01747-8","journal-title":"Appl Intell"},{"issue":"3","key":"2203_CR44","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TSC.2014.2310216","volume":"7","author":"M Doo","year":"2014","unstructured":"Doo M, Liu L (2014) Probabilistic diffusion of social influence with incentives. IEEE Trans Serv Comput 7(3):387\u2013400. https:\/\/doi.org\/10.1109\/TSC.2014.2310216","journal-title":"IEEE Trans Serv Comput"},{"issue":"3","key":"2203_CR45","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2700481","volume":"6","author":"M Bouguessa","year":"2015","unstructured":"Bouguessa M, Ben Romdhane L (2015) Identifying authorities in online communities. ACM Trans Intell Syst Technol 6(3):30. https:\/\/doi.org\/10.1145\/2700481","journal-title":"ACM Trans Intell Syst Technol"},{"key":"2203_CR46","doi-asserted-by":"publisher","first-page":"105554","DOI":"10.1016\/j.asoc.2019.105554","volume":"82","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019a) Lapso-im: a learning-based influence maximization approach for social networks. Appl Soft Comput 82:105554. https:\/\/doi.org\/10.1016\/j.asoc.2019.105554","journal-title":"Appl Soft Comput"},{"key":"2203_CR47","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.amc.2019.02.056","volume":"354","author":"Q He","year":"2019","unstructured":"He Q, Wang X, Lei Z, Huang M, Cai Y, Ma L (2019) Tifim: a two-stage iterative framework for influence maximization in social networks. J Comput Appl Math 354:338\u2013352. https:\/\/doi.org\/10.1016\/j.amc.2019.02.056","journal-title":"J Comput Appl Math"},{"issue":"1","key":"2203_CR48","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s13278-019-0566-x","volume":"9","author":"M Azaouzi","year":"2019","unstructured":"Azaouzi M, Rhouma D, Ben Romdhane L (2019) Community detection in large-scale social networks: state-of-the-art and future directions. Soc Netw Anal Min 9(1):23. https:\/\/doi.org\/10.1007\/s13278-019-0566-x","journal-title":"Soc Netw Anal Min"},{"key":"2203_CR49","unstructured":"Engstr\u00f6m C, Silvestrov S (2016) Graph partitioning and a componentwise pagerank algorithm. arXiv:1609.09068"},{"issue":"1","key":"2203_CR50","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R (1998) OpenMP: an industry standard API for shared-memory programming. IEEE Comput Sci Eng 5(1):46\u201355. https:\/\/doi.org\/10.1109\/99.660313","journal-title":"IEEE Comput Sci Eng"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02203-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02203-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02203-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T06:27:39Z","timestamp":1744180059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02203-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":50,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["2203"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02203-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"7 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}