{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T03:02:15Z","timestamp":1784430135609,"version":"3.55.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T00:00:00Z","timestamp":1649980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T00:00:00Z","timestamp":1649980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100008628","name":"Ministry of Electronics and Information technology","doi-asserted-by":"publisher","award":["Letter no 780\/UIET"],"award-info":[{"award-number":["Letter no 780\/UIET"]}],"id":[{"id":"10.13039\/501100008628","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008628","name":"Ministry of Electronics and Information technology","doi-asserted-by":"publisher","award":["3711\/GP"],"award-info":[{"award-number":["3711\/GP"]}],"id":[{"id":"10.13039\/501100008628","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13278-022-00876-x","type":"journal-article","created":{"date-parts":[[2022,4,15]],"date-time":"2022-04-15T17:09:21Z","timestamp":1650042561000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["$$\\text {BC}_{\\mathrm {DCN}}$$: a new edge centrality measure to identify and rank critical edges pertaining to SIR diffusion in complex networks"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4822-7795","authenticated-orcid":false,"given":"Kushal","family":"Kanwar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sakshi","family":"Kaushal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harish","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gaurav","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manju","family":"Khari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"issue":"2","key":"876_CR1","first-page":"4","volume":"30","author":"R Barnes","year":"2010","unstructured":"Barnes R, Burkett T (2010) Structural redundancy and multiplicity in corporate networks. Int Netw Soc Netw Anal 30(2):4\u201320","journal-title":"Int Netw Soc Netw Anal"},{"issue":"6","key":"876_CR2","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1093\/bioinformatics\/bti098","volume":"21","author":"T Beuming","year":"2005","unstructured":"Beuming T, Skrabanek L, Niv MY, Mukherjee P, Weinstein H (2005) PDZBase: a protein\u2013protein interaction database for PDZ-domains. Bioinformatics 21(6):827\u2013828","journal-title":"Bioinformatics"},{"issue":"2","key":"876_CR3","doi-asserted-by":"crossref","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":"1\u20133","key":"876_CR4","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1\u20133):564\u2013568","journal-title":"Theor Comput Sci"},{"key":"876_CR5","doi-asserted-by":"crossref","first-page":"P10011","DOI":"10.1088\/1742-5468\/2010\/10\/P10011","volume":"10","author":"XQ Cheng","year":"2010","unstructured":"Cheng XQ, Ren FX, Shen HW, Zhang ZK, Zhou T (2010) Bridgeness: a local index on edge significance in maintaining global connectivity. J Stat Mech Theory Exp 10:P10011","journal-title":"J Stat Mech Theory Exp"},{"key":"876_CR6","volume-title":"Introduction to mathematical sociology","author":"JS Coleman","year":"1964","unstructured":"Coleman JS (1964) Introduction to mathematical sociology. London Free Press, Glencoe"},{"issue":"2","key":"876_CR7","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/s11075-019-00704-y","volume":"83","author":"CO De la Cruz","year":"2020","unstructured":"De la Cruz CO, Matar M, Reichel L (2020) Edge importance in a network via line graphs and the matrix exponential. Numer Algorithms 83(2):807\u2013832","journal-title":"Numer Algorithms"},{"key":"876_CR8","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.knosys.2012.01.007","volume":"30","author":"P De Meo","year":"2012","unstructured":"De Meo P, Ferrara E, Fiumara G, Ricciardello A (2012) A novel measure of edge centrality in social networks. Knowl Based Syst 30:136\u2013150","journal-title":"Knowl Based Syst"},{"issue":"2","key":"876_CR9","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.72.027104","volume":"72","author":"J Duch","year":"2005","unstructured":"Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72(2):027104","journal-title":"Phys Rev E"},{"issue":"4","key":"876_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle N, Sandy PA (2006) Reality mining: sensing complex social systems. Pers Ubiquitous Comput 10(4):255\u2013268","journal-title":"Pers Ubiquitous Comput"},{"key":"876_CR11","first-page":"30","volume":"994","author":"RW Eash","year":"1983","unstructured":"Eash RW, Chon KS, Lee YJ, Boyce DE (1983) Equilibrium traffic assignment on an aggregated highway network for sketch planning. Transp Res Rec 994:30\u201337","journal-title":"Transp Res Rec"},{"key":"876_CR12","volume-title":"The structure of complex networks: theory and applications","author":"E Estrada","year":"2012","unstructured":"Estrada E (2012) The structure of complex networks: theory and applications. Oxford University Press, Oxford"},{"issue":"2","key":"876_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0378-8733(96)00300-0","volume":"19","author":"K Faust","year":"1997","unstructured":"Faust K (1997) Centrality in affiliation networks. Soc Netw 19(2):157\u2013191","journal-title":"Soc Netw"},{"issue":"2","key":"876_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0378-8733(97)00016-6","volume":"20","author":"LC Freeman","year":"1998","unstructured":"Freeman LC, Webster CM, Kirke DM (1998) Exploring social structure using dynamic three-dimensional color images. Soc Netw 20(2):109\u2013118","journal-title":"Soc Netw"},{"issue":"5","key":"876_CR15","first-page":"50001","volume":"116","author":"ZK Gao","year":"2017","unstructured":"Gao ZK, Small M, Kurths J (2017) Complex network analysis of time series. EPL (Europhys Lett) 116(5):50001","journal-title":"EPL (Europhys Lett)"},{"issue":"8","key":"876_CR16","doi-asserted-by":"crossref","DOI":"10.1088\/1367-2630\/14\/8\/083030","volume":"14","author":"A Garas","year":"2012","unstructured":"Garas A, Schweitzer F, Havlin S (2012) A k-shell decomposition method for weighted networks. New J Phys 14(8):083030","journal-title":"New J Phys"},{"issue":"12","key":"876_CR17","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"9","key":"876_CR18","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.95.098701","volume":"95","author":"C Giuraniuc","year":"2005","unstructured":"Giuraniuc C, Hatchett J, Indekeu J, Leone M, Castillo IP, Van Schaeybroeck B, Vanderzande C (2005) Trading interactions for topology in scale-free networks. Phys Rev Lett 95(9):098701","journal-title":"Phys Rev Lett"},{"issue":"6","key":"876_CR19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103","journal-title":"Phys Rev E"},{"key":"876_CR20","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in science conference (SciPy2008), Pasadena, CA USA, pp 11\u201315","DOI":"10.25080\/TCWV9851"},{"issue":"1","key":"876_CR21","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s13278-016-0332-2","volume":"6","author":"M Hamann","year":"2016","unstructured":"Hamann M, Lindner G, Meyerhenke H, Staudt CL, Wagner D (2016) Structure-preserving sparsification methods for social networks. Soc Netw Anal Min 6(1):22","journal-title":"Soc Netw Anal Min"},{"issue":"3","key":"876_CR22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0306-4573(89)90048-4","volume":"25","author":"L Hamers","year":"1989","unstructured":"Hamers L et al (1989) Similarity measures in scientometric research: the Jaccard index versus Salton\u2019s cosine formula. Inf Process Manag 25(3):315\u201318","journal-title":"Inf Process Manag"},{"issue":"7","key":"876_CR23","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1038\/nbt1116","volume":"23","author":"JDJ Han","year":"2005","unstructured":"Han JDJ, Dupuy D, Bertin N, Cusick ME, Vidal M (2005) Effect of sampling on topology predictions of protein\u2013protein interaction networks. Nat Biotechnol 23(7):839\u2013844","journal-title":"Nat Biotechnol"},{"issue":"5","key":"876_CR24","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1511\/2006.61.3495","volume":"94","author":"B Hayes","year":"2006","unstructured":"Hayes B (2006) Connecting the dots. Can the tools of graph theory and social-network studies unravel the next big plot? Am Sci 94(5):400\u2013404","journal-title":"Am Sci"},{"key":"876_CR25","doi-asserted-by":"crossref","unstructured":"Kanwar K, Kaushal S, Kumar H (2019) A hybrid node ranking technique for finding influential nodes in complex social networks. Library Hi Tech","DOI":"10.1108\/LHT-01-2019-0019"},{"issue":"3","key":"876_CR26","doi-asserted-by":"crossref","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":"2","key":"876_CR27","first-page":"9","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura M, Saito K, Motoda H (2009) Blocking links to minimize contamination spread in a social network. ACM Trans Knowl Discov Data (TKDD) 3(2):9","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"11","key":"876_CR28","doi-asserted-by":"crossref","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","journal-title":"Nat Phys"},{"issue":"314","key":"876_CR29","doi-asserted-by":"crossref","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":"876_CR30","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing, vol 37. Addison-Wesley, Reading"},{"key":"876_CR31","volume-title":"The art of computer programming, volume 4, fascicle 0: introduction to combinatorial and Boolean functions","author":"DE Knuth","year":"2008","unstructured":"Knuth DE (2008) The art of computer programming, volume 4, fascicle 0: introduction to combinatorial and Boolean functions. Addison-Wesley, Reading"},{"key":"876_CR32","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013a) KONECT\u2014The Koblenz network collection. In: Proceedings of the international conference on world wide web companion, pp 1343\u20131350. http:\/\/userpages.uni-koblenz.de\/~kunegis\/paper\/kunegis-koblenz-network-collection.pdf","DOI":"10.1145\/2487788.2488173"},{"key":"876_CR33","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013b) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web. ACM, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"876_CR34","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013c) Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"876_CR35","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0166-218X(98)00029-8","volume":"85","author":"TW Lam","year":"1998","unstructured":"Lam TW, Yue FL (1998) Edge ranking of graphs is hard. Discret Appl Math 85(1):71\u201386","journal-title":"Discret Appl Math"},{"key":"876_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15:1","journal-title":"Nat Phys"},{"key":"876_CR37","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"876_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2017.05.001","volume":"689","author":"H Liao","year":"2017","unstructured":"Liao H, Mariani MS, Medo M, Zhang YC, Zhou MY (2017) Ranking in evolving complex networks. Phys Rep 689:1\u201354","journal-title":"Phys Rep"},{"key":"876_CR39","doi-asserted-by":"crossref","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 XL, Zhang QM, Zhang YC, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1\u201363","journal-title":"Phys Rep"},{"key":"876_CR40","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"876_CR41","doi-asserted-by":"crossref","unstructured":"Melan\u00e7on G, Sallaberry A (2008) Edge metrics for visual graph analytics: a comparative study. In: 2008 12th international conference information visualisation. IEEE, pp 610\u2013615","DOI":"10.1109\/IV.2008.10"},{"issue":"4","key":"876_CR42","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0378-8733(01)00042-9","volume":"23","author":"J Moody","year":"2001","unstructured":"Moody J (2001) Peer influence groups: identifying dense clusters in large networks. Soc Netw 23(4):261\u2013283","journal-title":"Soc Netw"},{"issue":"1","key":"876_CR43","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.physa.2006.07.017","volume":"374","author":"M Nekovee","year":"2007","unstructured":"Nekovee M, Moreno Y, Bianconi G, Marsili M (2007) Theory of rumour spreading in complex social networks. Physica A 374(1):457\u2013470","journal-title":"Physica A"},{"issue":"2","key":"876_CR44","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"3","key":"876_CR45","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104","journal-title":"Phys Rev E"},{"key":"876_CR46","doi-asserted-by":"crossref","unstructured":"Nick B, Lee C, Cunningham P, Brandes U (2013) Simmelian backbones: amplifying hidden homophily in Facebook networks. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 525\u2013532","DOI":"10.1145\/2492517.2492569"},{"issue":"11","key":"876_CR47","doi-asserted-by":"crossref","first-page":"2688","DOI":"10.1016\/j.physa.2013.01.023","volume":"392","author":"GA Pagani","year":"2013","unstructured":"Pagani GA, Aiello M (2013) The power grid as a complex network: a survey. Physica A 392(11):2688\u20132700","journal-title":"Physica A"},{"key":"876_CR48","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:925\u2013979. https:\/\/doi.org\/10.1103\/RevModPhys.87.925","journal-title":"Rev Mod Phys"},{"key":"876_CR49","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1038\/nature04209","volume":"7062","author":"JF Rual","year":"2005","unstructured":"Rual JF, Venkatesan K, Hao T, Hirozane-Kishikawa T, Dricot A, Li N, Berriz GF, Gibbons FD, Dreze M, Ayivi-Guedehoussou N (2005) Towards a proteome-scale map of the human protein\u2013protein interaction network. Nature 7062:1173\u20131178","journal-title":"Nature"},{"key":"876_CR50","doi-asserted-by":"crossref","unstructured":"Saito K, Kimura M, Ohara K, Motoda H (2016) Detecting critical links in complex network to maintain information flow\/reachability. In: Pacific rim international conference on artificial intelligence. Springer, pp 419\u2013432","DOI":"10.1007\/978-3-319-42911-3_35"},{"key":"876_CR51","doi-asserted-by":"crossref","unstructured":"Shah N, Beutel A, Hooi B, Akoglu L, Gunnemann S, Makhija D, Kumar M, Faloutsos C (2016) Edgecentric: anomaly detection in edge-attributed networks. In: 2016 IEEE 16th international conference on data mining workshops (ICDMW). IEEE, pp 327\u2013334","DOI":"10.1109\/ICDMW.2016.0053"},{"issue":"8","key":"876_CR52","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.physa.2009.01.015","volume":"388","author":"JW Wang","year":"2009","unstructured":"Wang JW, Rong LL (2009) Edge-based-attack induced cascading failures on scale-free networks. Physica A 388(8):1731\u20131737","journal-title":"Physica A"},{"issue":"9","key":"876_CR53","doi-asserted-by":"crossref","first-page":"1294","DOI":"10.3390\/en10091294","volume":"10","author":"Z Wang","year":"2017","unstructured":"Wang Z, He J, Nechifor A, Zhang D, Crossley P (2017) Identification of critical transmission lines in complex power networks. Energies 10(9):1294","journal-title":"Energies"},{"issue":"4","key":"876_CR54","doi-asserted-by":"crossref","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 (TOIS) 28(4):20","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"876_CR55","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.is.2016.12.002","volume":"65","author":"P Wong","year":"2017","unstructured":"Wong P, Sun C, Lo E, Yiu ML, Wu X, Zhao Z, Chan THH, Kao B (2017) Finding k most influential edges on flow graphs. Inf Syst 65:93\u2013105","journal-title":"Inf Syst"},{"key":"876_CR56","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1109\/TNSE.2019.2903272","volume":"7","author":"R Yan","year":"2019","unstructured":"Yan R, Li D, Wu W, Du DZ, Wang Y (2019a) Minimizing influence of rumors by blockers on social networks: algorithms and analysis. IEEE Trans Netw Sci Eng 7:1067\u20131078","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"2","key":"876_CR57","first-page":"16","volume":"13","author":"R Yan","year":"2019","unstructured":"Yan R, Li Y, Wu W, Li D, Wang Y (2019b) Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discov Data (TKDD) 13(2):16","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"1","key":"876_CR58","doi-asserted-by":"crossref","first-page":"14469","DOI":"10.1038\/s41598-018-32631-8","volume":"8","author":"EY Yu","year":"2018","unstructured":"Yu EY, Chen DB, Zhao JY (2018) Identifying critical edges in complex networks. Sci Rep 8(1):14469","journal-title":"Sci Rep"},{"key":"876_CR59","doi-asserted-by":"crossref","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":"876_CR60","doi-asserted-by":"crossref","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"},{"key":"876_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2017.10.001","volume":"714","author":"A Zeng","year":"2017","unstructured":"Zeng A, Shen Z, Zhou J, Wu J, Fan Y, Wang Y, Stanley HE (2017) The science of science: from the perspective of complex systems. Phys Rep 714:1\u201373","journal-title":"Phys Rep"},{"key":"876_CR62","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.physa.2014.06.035","volume":"412","author":"J Zhang","year":"2014","unstructured":"Zhang J, Song B, Zhang Z, Liu H (2014) An approach for modeling vulnerability of the network of networks. Physica A 412:127\u2013136","journal-title":"Physica A"},{"key":"876_CR63","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.123877","volume":"548","author":"N Zhao","year":"2020","unstructured":"Zhao N, Li J, Wang J, Li T, Yu Y, Zhou T (2020) Identifying significant edges via neighborhood information. Physica A 548:123877","journal-title":"Physica A"},{"key":"876_CR64","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.physa.2016.01.048","volume":"452","author":"H Zhu","year":"2016","unstructured":"Zhu H, Yin X, Ma J, Hu W (2016) Identifying the main paths of information diffusion in online social networks. Physica A 452:320\u2013328","journal-title":"Physica A"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00876-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-022-00876-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00876-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T09:20:58Z","timestamp":1726996858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-022-00876-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,15]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["876"],"URL":"https:\/\/doi.org\/10.1007\/s13278-022-00876-x","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,15]]},"assertion":[{"value":"16 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}},{"value":"The publication has been approved by all co-authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"49"}}