{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:28:29Z","timestamp":1760171309238,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Ministry of Electronics and Information technology, Govt. of India","award":["Letter no 780\/UIET, 3711\/GP"],"award-info":[{"award-number":["Letter no 780\/UIET, 3711\/GP"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s00607-023-01218-1","type":"journal-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T12:01:56Z","timestamp":1693310516000},"page":"139-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient method for node ranking in complex networks by hybrid neighbourhood coreness"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4822-7795","authenticated-orcid":false,"given":"Kushal","family":"Kanwar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakshi","family":"Kaushal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harish","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manju","family":"Khari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"issue":"4","key":"1218_CR1","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1103\/RevModPhys.80.1275","volume":"80","author":"SN Dorogovtsev","year":"2008","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JFF (2008) Critical phenomena in complex networks. Rev Mod Phys 80(4):1275","journal-title":"Rev Mod Phys"},{"issue":"3","key":"1218_CR2","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1103\/RevModPhys.87.925","volume":"87","author":"R Pastor-Satorras","year":"2015","unstructured":"Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925","journal-title":"Rev Mod Phys"},{"issue":"1","key":"1218_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5","journal-title":"ACM Trans Web"},{"issue":"10","key":"1218_CR4","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1093\/aje\/kwi308","volume":"162","author":"RM Christley","year":"2005","unstructured":"Christley RM, Pinchbeck GL, Bowers RG, Clancy D, French NP, Bennett R, Turner J (2005) Infection in social networks: using network analysis to identify high-risk individuals. Am J Epidemiol 162(10):1024\u20131031","journal-title":"Am J Epidemiol"},{"issue":"2","key":"1218_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1257\/jep.31.2.211","volume":"31","author":"H Allcott","year":"2017","unstructured":"Allcott H, Gentzkow M (2017) Social media and fake news in the 2016 election. J Econ Perspect 31(2):211\u201336","journal-title":"J Econ Perspect"},{"issue":"1","key":"1218_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1080\/106307302317379855","volume":"9","author":"RG Little","year":"2002","unstructured":"Little RG (2002) Controlling cascading failure: understanding the vulnerabilities of interconnected infrastructures. J Urban Technol 9(1):109\u2013123","journal-title":"J Urban Technol"},{"issue":"1","key":"1218_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3233\/IDA-120571","volume":"17","author":"RM Tripathy","year":"2013","unstructured":"Tripathy RM, Bagchi A, Mehta S (2013) Towards combating rumors in social networks: models and metrics. Intell Data Anal 17(1):149\u2013175","journal-title":"Intell Data Anal"},{"issue":"2","key":"1218_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1177\/1090198104263660","volume":"31","author":"A Bandura","year":"2004","unstructured":"Bandura A (2004) Health promotion by social cognitive means. Health Edu Behav 31(2):143\u2013164","journal-title":"Health Edu Behav"},{"key":"1218_CR9","unstructured":"Lenhart A, Purcell K, Smith A, Zickuhr K (2010) Social media & mobile internet use among teens and young adults. millennials. Pew internet & American life project"},{"key":"1218_CR10","doi-asserted-by":"crossref","unstructured":"Hadgu Asmelash T, Garimella K, Weber I (2013) Political hashtag hijacking in the us. In: Proceedings of the 22nd international conference on World Wide Web, pp. 55\u201356. ACM","DOI":"10.1145\/2487788.2487809"},{"issue":"6","key":"1218_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.63.066117","volume":"63","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras R, Vespignani A (2001) Epidemic dynamics and endemic states in complex networks. Phys Rev E 63(6):066117","journal-title":"Phys Rev E"},{"key":"1218_CR12","doi-asserted-by":"crossref","unstructured":"Carnes T, Nagarajan C, Wild Stefan M, Van Zuylen A (2007) Maximizing influence in a competitive social network: a follower\u2019s perspective. In: Proceedings of the ninth international conference on Electronic commerce, pp. 351\u2013360. ACM","DOI":"10.1145\/1282100.1282167"},{"key":"1218_CR13","doi-asserted-by":"crossref","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: International workshop on internet and network economics, pp. 539\u2013550. Springer","DOI":"10.1007\/978-3-642-17572-5_48"},{"issue":"11","key":"1218_CR14","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, Lev Muchnik H, Stanley E, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"key":"1218_CR15","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 395:549\u2013559","journal-title":"Physica A"},{"key":"1218_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.physa.2016.05.048","volume":"461","author":"Z Wang","year":"2016","unstructured":"Wang Z, Zhao Y, Xi J, Changjiang D (2016) Fast ranking influential nodes in complex networks using a k-shell iteration factor. Physica A 461:171\u2013181","journal-title":"Physica A"},{"key":"1218_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2017.10.018","volume":"93","author":"A Zareie","year":"2018","unstructured":"Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Expert Syst Appl 93:200\u2013211","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1218_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"key":"1218_CR19","doi-asserted-by":"crossref","unstructured":"Freeman Linton C (1977) A set of measures of centrality based on betweenness. Sociometry, pp 35\u201341","DOI":"10.2307\/3033543"},{"issue":"4","key":"1218_CR20","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581\u2013603","journal-title":"Psychometrika"},{"issue":"6","key":"1218_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"1","key":"1218_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J ACM 24(1):1\u201313","journal-title":"J ACM"},{"issue":"2","key":"1218_CR23","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"},{"issue":"4","key":"1218_CR24","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, L\u00fc L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica A 391(4):1777\u20131787","journal-title":"Physica A"},{"key":"1218_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Chen D, Ren X-L, Zhang Q-M, Zhang Y-C, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1\u201363","journal-title":"Phys Rep"},{"key":"1218_CR26","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.physa.2018.09.064","volume":"514","author":"A Zareie","year":"2019","unstructured":"Zareie A, Sheikhahmadi A (2019) Ehc: Extended h-index centrality measure for identification of users\u2019 spreading influence in complex networks. Physica A 514:141\u2013155","journal-title":"Physica A"},{"key":"1218_CR27","doi-asserted-by":"publisher","first-page":"10168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Zhou T, Zhang Q-M, Eugene Stanley H (2016) The H-index of a network node and its relation to degree and coreness. Nat Commun 7:10168","journal-title":"Nat Commun"},{"key":"1218_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.chaos.2016.01.030","volume":"86","author":"Y Liu","year":"2016","unstructured":"Liu Y, Wei B, Yuxian D, Xiao F, Deng Y (2016) Identifying influential spreaders by weight degree centrality in complex networks. Chaos Solitons Fractals 86:1\u20137","journal-title":"Chaos Solitons Fractals"},{"issue":"06","key":"1218_CR29","doi-asserted-by":"publisher","first-page":"1850118","DOI":"10.1142\/S0217979218501187","volume":"32","author":"M Li","year":"2018","unstructured":"Li M, Zhang R, Rongjing H, Yang F, Yao Y, Yuan Y (2018) Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient. Int J Mod Phys B 32(06):1850118","journal-title":"Int J Mod Phys B"},{"issue":"4","key":"1218_CR30","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"SP Borgatti","year":"2000","unstructured":"Borgatti SP, Everett MG (2000) Models of core\/periphery structures. Soc Netw 21(4):375\u2013395","journal-title":"Soc Netw"},{"issue":"14","key":"1218_CR31","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.physleta.2013.02.039","volume":"377","author":"A Zeng","year":"2013","unstructured":"Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377(14):1031\u20131035","journal-title":"Phys Lett A"},{"key":"1218_CR32","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.cam.2018.05.051","volume":"320","author":"C Li","year":"2018","unstructured":"Li C, Wang L, Sun S, Xia C (2018) Identification of influential spreaders based on classified neighbors in real-world complex networks. Appl Math Comput 320:512\u2013523","journal-title":"Appl Math Comput"},{"key":"1218_CR33","doi-asserted-by":"crossref","unstructured":"Salavati C, Abdollahpouri A, Manbari Z (2017) Bridgerank: A novel fast centrality measure based on local structure of the network. Physica A Stat Mech Appl","DOI":"10.1016\/j.physa.2017.12.087"},{"key":"1218_CR34","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.physa.2018.02.016","volume":"499","author":"A Namtirtha","year":"2018","unstructured":"Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310\u2013324","journal-title":"Physica A"},{"key":"1218_CR35","first-page":"388","volume":"334","author":"J Wang","year":"2018","unstructured":"Wang J, Li C, Xia C (2018) Improved centrality indicators to characterize the nodal spreading capability in complex networks. Appl Math Comput 334:388\u2013400","journal-title":"Appl Math Comput"},{"key":"1218_CR36","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.physa.2018.02.016","volume":"499","author":"A Namtirtha","year":"2018","unstructured":"Namtirtha A, Dutta A, Dutta B (2018) Identifying influential spreaders in complex networks based on Kshell hybrid method. Physica A 499:310\u2013324","journal-title":"Physica A"},{"key":"1218_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2021.111309","volume":"152","author":"P Liu","year":"2021","unstructured":"Liu P, Li L, Fang S, Yao Y (2021) Identifying influential nodes in social networks: a voting approach. Chaos, Solitons Fractals 152:111309","journal-title":"Chaos, Solitons Fractals"},{"key":"1218_CR38","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":"1218_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.127797","volume":"603","author":"C Dong","year":"2022","unstructured":"Dong C, Guiqiong X, Meng L, Yang P (2022) Cpr-topsis: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy. Physica A 603:127797","journal-title":"Physica A"},{"issue":"4","key":"1218_CR40","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.3390\/app12041944","volume":"12","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Yuliang L, Yang G, Hang Z (2022) Multi-attribute decision making method for node importance metric in complex network. Appl Sci 12(4):1944","journal-title":"Appl Sci"},{"key":"1218_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113024","volume":"142","author":"A Hashemi","year":"2020","unstructured":"Hashemi A, Dowlatshahi MB, Nezamabadi-pour H (2020) Mgfs: a multi-label graph-based feature selection algorithm via PageRank centrality. Expert Syst Appl 142:113024","journal-title":"Expert Syst Appl"},{"key":"1218_CR42","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.ins.2022.07.084","volume":"609","author":"J Zhao","year":"2022","unstructured":"Zhao J, Wen T, Jahanshahi H, Cheong KH (2022) The random walk-based gravity model to identify influential nodes in complex networks. Inf Sci 609:1706\u20131720","journal-title":"Inf Sci"},{"key":"1218_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112971","volume":"142","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971","journal-title":"Expert Syst Appl"},{"key":"1218_CR44","doi-asserted-by":"crossref","unstructured":"Devi S, Rajalakshmi M (2023) Community based influencer node identification using hybrid optimisation algorithm in social networks. J Exp Theor Artif Intell, pp 1\u201328","DOI":"10.1080\/0952813X.2023.2217831"},{"issue":"1","key":"1218_CR45","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/e22010052","volume":"22","author":"Y Li","year":"2020","unstructured":"Li Y, Cai W, Li Y, Xin D (2020) Key node ranking in complex networks: a novel entropy and mutual information-based approach. Entropy 22(1):52","journal-title":"Entropy"},{"issue":"5","key":"1218_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3446217","volume":"15","author":"SK Maurya","year":"2021","unstructured":"Maurya SK, Liu X, Murata T (2021) Graph neural networks for fast node ranking approximation. ACM Trans Knowl Discov Data 15(5):1\u201332","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1218_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109220","volume":"251","author":"C Liu","year":"2022","unstructured":"Liu C, Cao T, Zhou L (2022) Learning to rank complex network node based on the self-supervised graph convolution model. Knowl-Based Syst 251:109220","journal-title":"Knowl-Based Syst"},{"key":"1218_CR48","doi-asserted-by":"crossref","unstructured":"Hagberg Aric A, Schult Daniel A, Swart Pieter J (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in science conference (SciPy2008), pp. 11\u201315, Pasadena, CA USA","DOI":"10.25080\/TCWV9851"},{"issue":"4","key":"1218_CR49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"key":"1218_CR50","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graphs, i. Publicationes Mathematicae (Debrecen) 6:290\u2013297","journal-title":"Publicationes Mathematicae (Debrecen)"},{"issue":"17\u201361","key":"1218_CR51","first-page":"43","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(17\u201361):43","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"1218_CR52","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1218_CR53","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. ACM","DOI":"10.1145\/2487788.2488173"},{"key":"1218_CR54","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"},{"issue":"1","key":"1218_CR55","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1186\/1471-2105-13-76","volume":"13","author":"T Hladish","year":"2012","unstructured":"Hladish T, Melamud E, Barrera LA, Galvani A, Meyers LA (2012) Epifire: an open source c++ library and application for contact network epidemiology. BMC Bioinf 13(1):76","journal-title":"BMC Bioinf"},{"issue":"3","key":"1218_CR56","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/biomet\/33.3.239","volume":"33","author":"MG Kendall","year":"1945","unstructured":"Kendall MG (1945) The treatment of ties in ranking problems. Biometrika 33(3):239\u2013251","journal-title":"Biometrika"},{"issue":"314","key":"1218_CR57","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1080\/01621459.1966.10480879","volume":"61","author":"WR Knight","year":"1966","unstructured":"Knight WR (1966) A computer method for calculating Kendall\u2019s tau with ungrouped data. J Am Stat Assoc 61(314):436\u2013439","journal-title":"J Am Stat Assoc"},{"key":"1218_CR58","unstructured":"Kushal K, Sakshi K, Harish K (2019) A hybrid node ranking technique for finding influential nodes in complex social networks. Library Hi Tech"},{"issue":"4","key":"1218_CR59","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1852102.1852106","volume":"28","author":"W Webber","year":"2010","unstructured":"Webber W, Moffat A, Zobel J (2010) A similarity measure for indefinite rankings. ACM Trans Inf Syst 28(4):20","journal-title":"ACM Trans Inf Syst"},{"issue":"1","key":"1218_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01174341","volume":"33","author":"FK Schmidt","year":"1931","unstructured":"Schmidt FK (1931) Analytische zahlentheorie in k\u00f6rpern der charakteristikp. Math Z 33(1):1\u201332","journal-title":"Math Z"},{"key":"1218_CR61","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01218-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01218-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01218-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:59:29Z","timestamp":1729990769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01218-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,29]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1218"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01218-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2023,8,29]]},"assertion":[{"value":"16 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2023","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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"The publication has been approved by all co-authors.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}