{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:23:44Z","timestamp":1717115024179},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T00:00:00Z","timestamp":1709510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T00:00:00Z","timestamp":1709510400000},"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":["Computing"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00607-024-01265-2","type":"journal-article","created":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T06:02:20Z","timestamp":1709532140000},"page":"1825-1843","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Time-sensitive propagation values discount centrality measure"],"prefix":"10.1007","volume":"106","author":[{"given":"Salman","family":"Mokhtarzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behzad","family":"Zamani Dehkordi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mosleh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Barati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,4]]},"reference":[{"issue":"10","key":"1265_CR1","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/2794367.2794370","volume":"8","author":"M Wang","year":"2015","unstructured":"Wang M, Wang C, Yu JX, Zhang J (2015) Community detection in social networks: an in-depth benchmarking study with a procedure-oriented framework. Proc VLDB Endow 8(10):998\u20131009","journal-title":"Proc VLDB Endow"},{"key":"1265_CR2","doi-asserted-by":"crossref","unstructured":"Guellil I, Boukhalfa K (2015) Social big data mining: A survey focused on opinion mining and sentiments analysis. In: 2015 12th international symposium on programming and systems (ISPS), pp 1\u201310. IEEE","DOI":"10.1109\/ISPS.2015.7244976"},{"key":"1265_CR3","doi-asserted-by":"crossref","unstructured":"Kim TY, Kim HJ et al. (2022) Opinion mining-based term extraction sentiment classification modeling. Mobile Inf Syst 2022","DOI":"10.1155\/2022\/5593147"},{"issue":"751\u2013782","key":"1265_CR4","first-page":"15","volume":"45","author":"Y Yang","year":"2015","unstructured":"Yang Y, Lichtenwalter RN, Chawla NV (2015) Evaluating link prediction methods. Knowl Inf Syst 45(751\u2013782):15","journal-title":"Knowl Inf Syst"},{"key":"1265_CR5","doi-asserted-by":"crossref","unstructured":"Patel R, Guo Y, Alhudhaif A, Alenezi F, Althubiti SA, Polat K et al. (2021) Graph-based link prediction between human phenotypes and genes. Math Probl Eng 2022","DOI":"10.1155\/2022\/7111647"},{"key":"1265_CR6","first-page":"1","volume":"2021","author":"G Sun","year":"2021","unstructured":"Sun G, Chen C-C (2021) Influence maximization algorithm based on reverse reachable set. Math Probl Eng 2021:1\u201312","journal-title":"Math Probl Eng"},{"key":"1265_CR7","doi-asserted-by":"crossref","unstructured":"Chen J, Wei N, Yang H et al. (2022) Immune algorithm to suppress rumor propagation based on influence maximization. Secur Commun Netw 2022","DOI":"10.1155\/2022\/6785828"},{"issue":"1","key":"1265_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-018-0062-7","volume":"3","author":"W Wang","year":"2018","unstructured":"Wang W, Street WN (2018) Modeling and maximizing influence diffusion in social networks for viral marketing. Appl Netw Sci 3(1):1\u201326","journal-title":"Appl Netw Sci"},{"key":"1265_CR9","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2002) Mining the network value of customers\/proceedings of the seventh international conference on knowledge discovery and data mining. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/502512.502525"},{"key":"1265_CR10","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through \u00b4 a social network. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1265_CR11","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. Inf Sci 493:217\u2013231","journal-title":"Inf Sci"},{"issue":"10","key":"1265_CR12","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 (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":"1265_CR13","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","journal-title":"J Netw Comput Appl"},{"key":"1265_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin 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, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1265_CR15","doi-asserted-by":"crossref","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, pp 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"1265_CR16","doi-asserted-by":"crossref","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"key":"1265_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.physa.2017.05.098","volume":"486","author":"A Sheikhahmadi","year":"2017","unstructured":"Sheikhahmadi A, Nematbakhsh MA, Zareie A (2017) Identification of influential users by neighbors in online social networks. Physica A 486:517\u2013534","journal-title":"Physica A"},{"key":"1265_CR18","unstructured":"Chen W, Castillo C, Lakshmanan LV (2022) Information and influence propagation in social networks. Springer"},{"key":"1265_CR19","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: Proceedings of the 2016 international conference on management of data, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"1265_CR20","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining, pp 918\u2013923. IEEE","DOI":"10.1109\/ICDM.2012.79"},{"key":"1265_CR21","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, pp 88\u201397. IEEE","DOI":"10.1109\/ICDM.2010.118"},{"key":"1265_CR22","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","journal-title":"Expert Syst Appl"},{"key":"1265_CR23","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"1265_CR24","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, pp 211\u2013220 (2011). IEEE","DOI":"10.1109\/ICDM.2011.132"},{"key":"1265_CR25","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Approximate solutions for the influence maximization problem in a social network. In: International conference on knowledge-based and intelligent information and engineering systems, pp 937\u2013944. Springer","DOI":"10.1007\/11893004_120"},{"key":"1265_CR26","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K-i (2014) Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: Proceedings of the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"1265_CR27","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, pp 946\u2013957. SIAM","DOI":"10.1137\/1.9781611973402.70"},{"key":"1265_CR28","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM international conference on information knowledge management, pp 17 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"1265_CR29","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, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"1265_CR30","doi-asserted-by":"publisher","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":"1265_CR31","doi-asserted-by":"crossref","unstructured":"Yan R, Li Y, Li D, Zhu Y, Wang Y, Du H (2019) Activation probability maximization for target users under influence decay model. In: Computing and combinatorics: 25th international conference, COCOON 2019, Xi\u2019an, China, 2019, Proceedings 25, pp 603\u2013614 (2019). Springer","DOI":"10.1007\/978-3-030-26176-4_50"},{"key":"1265_CR32","doi-asserted-by":"crossref","unstructured":"Hu M, Liu Q, Huang H, Jia X (2018) Time-sensitive influence maximization in social networks. In: 2018 IEEE 18th international conference on communication technology (ICCT), pp 1351\u20131356 (2018). IEEE","DOI":"10.1109\/ICCT.2018.8600272"},{"key":"1265_CR33","doi-asserted-by":"publisher","first-page":"126353","DOI":"10.1016\/j.physa.2021.126353","volume":"584","author":"Y Wang","year":"2021","unstructured":"Wang Y, Zhang Y, Yang F, Li D, Sun X, Ma J (2021) Time-sensitive positive influence maximization in signed social networks. Physica A 584:126353","journal-title":"Physica A"},{"key":"1265_CR34","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1007\/s11280-020-00792-0","volume":"23","author":"H Min","year":"2020","unstructured":"Min H, Cao J, Yuan T, Liu B (2020) Topic based time-sensitive influence maximization in online social networks. World Wide Web 23:1831\u20131859","journal-title":"World Wide Web"},{"issue":"3","key":"1265_CR35","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s00607-021-00987-x","volume":"104","author":"S Banerjee","year":"2022","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2022) An approximate marginal spread computation approach for the budgeted influence maximization with delay. Computing 104(3):657\u2013680","journal-title":"Computing"},{"key":"1265_CR36","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on web search and data mining, pp 241\u2013250","DOI":"10.1145\/1718487.1718518"},{"key":"1265_CR37","doi-asserted-by":"crossref","unstructured":"Saito K, Kimura M, Ohara K, Motoda H (2009) Learning continuous-time information diffusion model for social behavioral data analysis. In: Advances in machine learning: first Asian conference on machine learning, ACML 2009, Nanjing, China, November 2\u20134, 2009. Proceedings 1, pp 322\u2013337. Springer","DOI":"10.1007\/978-3-642-05224-8_25"},{"key":"1265_CR38","doi-asserted-by":"publisher","first-page":"126480","DOI":"10.1016\/j.physa.2021.126480","volume":"586","author":"JJ Lotf","year":"2022","unstructured":"Lotf JJ, Azgomi MA, Dishabi MRE (2022) An improved influence maximization method for social networks based on genetic algorithm. Physica A 586:126480","journal-title":"Physica A"},{"issue":"104773\u2013104819","key":"1265_CR39","first-page":"18","volume":"9","author":"Z Wan","year":"2021","unstructured":"Wan Z, Mahajan Y, Kang BW, Moore TJ, Cho J-H (2021) A survey on centrality metrics and their network resilience analysis. IEEE Access 9(104773\u2013104819):18","journal-title":"IEEE Access"},{"key":"1265_CR40","first-page":"238","volume":"1","author":"LC Freeman","year":"2002","unstructured":"Freeman LC et al (2002) Centrality in social networks: conceptual clarification. Soc Netw Crit Concepts Sociol 1:238\u2013263","journal-title":"Soc Netw Crit Concepts Sociol"},{"key":"1265_CR41","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, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1265_CR42","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.physa.2016.05.020","volume":"461","author":"X Wang","year":"2016","unstructured":"Wang X, Su Y, Zhao C, Yi D (2016) Effective identification of multiple influential spreaders by degree punishment. Physica A 461:238\u2013247","journal-title":"Physica A"},{"key":"1265_CR43","doi-asserted-by":"publisher","first-page":"121891","DOI":"10.1016\/j.physa.2019.121891","volume":"532","author":"P Jia","year":"2019","unstructured":"Jia P, Liu J, Huang C, Liu L, Xu C (2019) An improvement method for degree and its extending centralities in directed networks. Physica A 532:121891","journal-title":"Physica A"},{"issue":"8","key":"1265_CR44","doi-asserted-by":"publisher","first-page":"12200","DOI":"10.1371\/journal.pone.0012200","volume":"5","author":"KE Joyce","year":"2010","unstructured":"Joyce KE, Laurienti PJ, Burdette JH, Hayasaka S (2010) A new measure of centrality for brain networks. PLoS ONE 5(8):12200","journal-title":"PLoS ONE"},{"key":"1265_CR45","doi-asserted-by":"crossref","unstructured":"Raychaudhuri A, Mallick S, Sircar A, Singh S (2020) Identifying influential nodes based on network topology: a comparative study. In: Information, photonics and communication: proceedings of second national conference, IPC 2019, pp 65\u201376. Springer","DOI":"10.1007\/978-981-32-9453-0_7"},{"issue":"6","key":"1265_CR46","first-page":"3383","volume":"26","author":"ME Keskin","year":"2018","unstructured":"Keskin ME, G\u00a8uler MG, (2018) Influence maximization in social networks: an integer programming approach. Turkish J Electr Eng Comput Sci 26(6):3383\u20133396","journal-title":"Turkish J Electr Eng Comput Sci"},{"key":"1265_CR47","doi-asserted-by":"crossref","unstructured":"Kundu S, Murthy C, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: Pattern recognition and machine intelligence: 4th International Conference, PReMI 2011, Moscow, Russia, 2011. Proceedings 4, pp 242\u2013247 (2011). Springer","DOI":"10.1007\/978-3-642-21786-9_40"},{"issue":"4","key":"1265_CR48","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","volume":"29","author":"P Bonacich","year":"2007","unstructured":"Bonacich P (2007) Some unique properties of eigenvector centrality. Soc Netw 29(4):555\u2013564","journal-title":"Soc Netw"},{"issue":"11","key":"1265_CR49","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 HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"1","key":"1265_CR50","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"issue":"549\u2013559","key":"1265_CR51","first-page":"19","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 395(549\u2013559):19","journal-title":"Physica A"},{"issue":"1\u20137","key":"1265_CR52","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"4","key":"1265_CR53","doi-asserted-by":"publisher","first-page":"12676","DOI":"10.1111\/exsy.12676","volume":"40","author":"B Chatterjee","year":"2023","unstructured":"Chatterjee B, Bhattacharyya T, Ghosh KK, Chatterjee A, Sarkar R (2023) A novel meta-heuristic approach for influence maximization in social networks. Expert Syst 40(4):12676","journal-title":"Expert Syst"},{"issue":"2","key":"1265_CR54","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00607-021-00960-8","volume":"104","author":"S Kumar","year":"2022","unstructured":"Kumar S, Lohia D, Pratap D, Krishna A, Panda B (2022) Mder: modified degree with exclusion ratio algorithm for influence maximisation in social networks. Computing 104(2):359\u2013382","journal-title":"Computing"},{"key":"1265_CR55","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry, 35\u201341","DOI":"10.2307\/3033543"},{"key":"1265_CR56","doi-asserted-by":"crossref","unstructured":"Yoshida Y (2014) Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1416\u20131425","DOI":"10.1145\/2623330.2623626"},{"issue":"2","key":"1265_CR57","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177","journal-title":"J Math Sociol"},{"key":"1265_CR58","doi-asserted-by":"crossref","unstructured":"Crescenzi P, d\u2019Angelo G, Severini L, Velaj Y (2015) Greedily improving our own centrality in a network. In: International symposium on experimental algorithms, pp 43\u201355 (2015). Springer","DOI":"10.1007\/978-3-319-20086-6_4"},{"issue":"1","key":"1265_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K Stephenson","year":"1989","unstructured":"Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11(1):1\u201337","journal-title":"Soc Netw"},{"key":"1265_CR60","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.physa.2016.02.028","volume":"452","author":"Y Liu","year":"2016","unstructured":"Liu Y, Tang M, Zhou T, Do Y (2016) Identify influential spreaders in complex networks, the role of neighborhood. Physica A 452:289\u2013298","journal-title":"Physica A"},{"key":"1265_CR61","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BF02476438","volume":"15","author":"A Shimbel","year":"1953","unstructured":"Shimbel A (1953) Structural parameters of communication networks. Bull Math Biophys 15:501\u2013507","journal-title":"Bull Math Biophys"},{"key":"1265_CR62","doi-asserted-by":"crossref","unstructured":"Alhajj R, Rokne J (2014) Encyclopedia of social network analysis and mining. Springer","DOI":"10.1007\/978-1-4614-6170-8"},{"issue":"6","key":"1265_CR63","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1177\/0165551515602808","volume":"41","author":"A Mohammadi","year":"2015","unstructured":"Mohammadi A, Saraee M, Mirzaei A (2015) Time-sensitive influence maximization in social networks. J Inf Sci 41(6):765\u2013778","journal-title":"J Inf Sci"},{"issue":"3","key":"1265_CR64","first-page":"359","volume":"51","author":"S Mokhtarizadeh","year":"2021","unstructured":"Mokhtarizadeh S, Zamani Dehkordi B, Mosleh M, Barati A (2021) Influence maximization using time delay based harmonic centrality in social networks. Tabriz J Electr Eng 51(3):359\u2013370","journal-title":"Tabriz J Electr Eng"},{"key":"1265_CR65","doi-asserted-by":"crossref","unstructured":"Adineh M, Nouri-Baygi M (2019) High quality degree based heuristics for the influence maximization problem. arXiv preprint arXiv:1904.12164 20","DOI":"10.1109\/ICCKE.2018.8566515"},{"key":"1265_CR66","unstructured":"Saxena A, Iyengar S (2020) Centrality measures in complex networks: a survey. arXiv preprint arXiv:2011.07190"},{"key":"1265_CR67","first-page":"1","volume":"27","author":"K Hanauer","year":"2022","unstructured":"Hanauer K, Schulz C, Trummer J (2022) O\u2019reach: even faster reachability in large graphs. ACM J Exp Algorithmics 27:1\u201327","journal-title":"ACM J Exp Algorithmics"},{"issue":"1","key":"1265_CR68","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S Pettie","year":"2004","unstructured":"Pettie S (2004) A new approach to all-pairs shortest paths on real-weighted graphs. Theoret Comput Sci 312(1):47\u201374","journal-title":"Theoret Comput Sci"},{"key":"1265_CR69","doi-asserted-by":"crossref","unstructured":"Saha A, Sengupta N, Ramanath M (2019) Reachability in large graphs using bloom filters. In: 2019 IEEE 35th international conference on data engineering workshops (ICDEW), pp 217\u2013224 (2019). IEEE","DOI":"10.1109\/ICDEW.2019.000-9"},{"key":"1265_CR70","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2013) Introduction to algorithms second edition. the knuth-morris-pratt algorithm, 2001. On quantitative evaluation of systems, qest. In: Proceedings, vol 8054, pp 22\u201338"},{"issue":"6","key":"1265_CR71","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup M (2004) Compact oracles for reachability and approximate distances in planar digraphs. J ACM (JACM) 51(6):993\u20131024","journal-title":"J ACM (JACM)"},{"issue":"3","key":"1265_CR72","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(75)90019-8","volume":"3","author":"T Kameda","year":"1975","unstructured":"Kameda T (1975) On the vector representation of the reachability in planar directed graphs. Inf Process Lett 3(3):75\u201377","journal-title":"Inf Process Lett"},{"issue":"1","key":"1265_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1929934.1929941","volume":"36","author":"R Jin","year":"2011","unstructured":"Jin R, Ruan N, Xiang Y, Wang H (2011) Path-tree: an efficient reachability indexing scheme for large directed graphs. ACM Transact Database Syst (TODS) 36(1):1\u201344","journal-title":"ACM Transact Database Syst (TODS)"},{"key":"1265_CR74","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"1265_CR75","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01265-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-024-01265-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01265-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T18:10:07Z","timestamp":1717092607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-024-01265-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,4]]},"references-count":75,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1265"],"URL":"https:\/\/doi.org\/10.1007\/s00607-024-01265-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,4]]},"assertion":[{"value":"23 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest regarding the paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}