{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:37:31Z","timestamp":1778643451376,"version":"3.51.4"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003549","name":"hungarian scientific research fund","doi-asserted-by":"publisher","award":["Artificial Intelligence National Laboratory Programme"],"award-info":[{"award-number":["Artificial Intelligence National Laboratory Programme"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015498","name":"Ministry for Innovation and Technology","doi-asserted-by":"crossref","award":["UNKP-20-3"],"award-info":[{"award-number":["UNKP-20-3"]}],"id":[{"id":"10.13039\/501100015498","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003827","name":"Nemzeti Kutat\u00e1si \u00e9s Technol\u00f3giai Hivatal","doi-asserted-by":"publisher","award":["K123782"],"award-info":[{"award-number":["K123782"]}],"id":[{"id":"10.13039\/501100003827","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Research on fractal networks is a dynamically growing field of network science. A central issue is to analyze the fractality with the so-called box-covering method. As this problem is known to be NP-hard, a plethora of approximating algorithms have been proposed throughout the years. This study aims to establish a unified framework for comparing approximating box-covering algorithms by collecting, implementing, and evaluating these methods in various aspects including running time and approximation ability. This work might also serve as a reference for both researchers and practitioners, allowing fast selection from a rich collection of box-covering algorithms with a publicly available codebase.<\/jats:p>","DOI":"10.1007\/s41109-021-00410-6","type":"journal-article","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T05:03:44Z","timestamp":1632978224000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Comparative analysis of box-covering algorithms for fractal networks"],"prefix":"10.1007","volume":"6","author":[{"given":"P\u00e9ter Tam\u00e1s","family":"Kov\u00e1cs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcell","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0666-5279","authenticated-orcid":false,"given":"Roland","family":"Molontay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"410_CR1","doi-asserted-by":"crossref","unstructured":"Akiba T, Nakamura K, Takaguchi T (2016) Fractality of massive graphs: scalable analysis with sketch-based box-covering algorithm. arXiv:1609.07994","DOI":"10.1109\/ICDM.2016.0088"},{"key":"410_CR2","unstructured":"Chen J (2017) Tokyo metro. https:\/\/github.com\/onlyuser\/tokyo-metro"},{"issue":"4","key":"410_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi CR, Newman ME (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661\u2013703. https:\/\/doi.org\/10.1137\/070710111","journal-title":"SIAM Rev"},{"key":"410_CR4","doi-asserted-by":"publisher","unstructured":"Deng Y, Zheng W, Pan Q (2016) Performance evaluation of fractal dimension method based on box-covering algorithm in complex network. In: 2016 IEEE 20th international conference on computer supported cooperative work in design (CSCWD), pp 682\u2013686. https:\/\/doi.org\/10.1109\/CSCWD.2016.7566071","DOI":"10.1109\/CSCWD.2016.7566071"},{"key":"410_CR5","volume-title":"Fractal geometry: mathematical foundations and applications","author":"K Falconer","year":"2004","unstructured":"Falconer K (2004) Fractal geometry: mathematical foundations and applications. Wiley, Hoboken"},{"issue":"19","key":"410_CR6","doi-asserted-by":"publisher","first-page":"7746","DOI":"10.1073\/pnas.0700250104","volume":"104","author":"LK Gallos","year":"2007","unstructured":"Gallos LK, Song C, Havlin S, Makse HA (2007) Scaling theory of transport in complex biological networks. Proc Natl Acad Sci 104(19):7746\u20137751. https:\/\/doi.org\/10.1073\/pnas.0700250104","journal-title":"Proc Natl Acad Sci"},{"key":"410_CR7","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.physa.2007.07.069","volume":"386","author":"L Gallos","year":"2007","unstructured":"Gallos L, Song C, Makse H (2007) A review of fractality and self-similarity in complex networks. Physica A 386:686\u2013691. https:\/\/doi.org\/10.1016\/j.physa.2007.07.069","journal-title":"Physica A"},{"issue":"4","key":"410_CR8","doi-asserted-by":"publisher","first-page":"046109","DOI":"10.1103\/PhysRevE.78.046109","volume":"78","author":"L Gao","year":"2008","unstructured":"Gao L, Hu Y, Di Z (2008) Accuracy of the ball-covering approach for fractal dimensions of complex networks and a rank-driven algorithm. Phys Rev E 78(4):046109. https:\/\/doi.org\/10.1103\/PhysRevE.78.046109","journal-title":"Phys Rev E"},{"issue":"4","key":"410_CR9","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1007\/s11269-021-02773-y","volume":"35","author":"C Giudicianni","year":"2021","unstructured":"Giudicianni C, Di Nardo A, Greco R, Scala A (2021) A community-structure-based method for estimating the fractal dimension, and its application to water networks for the assessment of vulnerability to disasters. Water Resour Manag 35(4):1197\u20131210. https:\/\/doi.org\/10.1007\/s11269-021-02773-y","journal-title":"Water Resour Manag"},{"key":"410_CR10","doi-asserted-by":"publisher","unstructured":"Gong F, Li Y, Zhao D, Zhang L (2020) A deterministic box-covering algorithm for fractal dimension calculation of complex networks. In: 2020 IEEE 9th data driven control and learning systems conference (DDCLS), pp 409\u2013414. https:\/\/doi.org\/10.1109\/DDCLS49620.2020.9275236","DOI":"10.1109\/DDCLS49620.2020.9275236"},{"key":"410_CR11","unstructured":"Hagberg A, Swart P, Chult SD (2008) Exploring network structure, dynamics, and function using NetworkX. Technical report, Los Alamos National Lab.(LANL), Los Alamos, NM (United States). https:\/\/networkx.org\/"},{"key":"410_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-8944-2_78","author":"Y Huang","year":"2019","unstructured":"Huang Y, Zhang S, Bao X-l, Yao M-h, Wang Y (2019) Survey on fractality in complex networks. Recent Dev Intell Comput Commun Dev. https:\/\/doi.org\/10.1007\/978-981-10-8944-2_78","journal-title":"Recent Dev Intell Comput Commun Dev"},{"key":"410_CR13","doi-asserted-by":"publisher","first-page":"026116","DOI":"10.1063\/1.2737827","volume":"17","author":"J Kim","year":"2007","unstructured":"Kim J, Goh K-I, Kahng B, Kim D (2007) A box-covering algorithm for fractal scaling in scale-free networks. Chaos (Woodbury N.Y.) 17:026116. https:\/\/doi.org\/10.1063\/1.2737827","journal-title":"Chaos (Woodbury N.Y.)"},{"issue":"5","key":"410_CR14","doi-asserted-by":"publisher","first-page":"056115","DOI":"10.1103\/PhysRevE.75.056115","volume":"75","author":"M Kitsak","year":"2007","unstructured":"Kitsak M, Havlin S, Paul G, Riccaboni M, Pammolli F, Stanley HE (2007) Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. Phys Rev E 75(5):056115. https:\/\/doi.org\/10.1103\/PhysRevE.75.056115","journal-title":"Phys Rev E"},{"issue":"5","key":"410_CR15","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/comnet\/cnz005","volume":"7","author":"J Komj\u00e1thy","year":"2019","unstructured":"Komj\u00e1thy J, Molontay R, Simon K (2019) Transfinite fractal dimension of trees and hierarchical scale-free graphs. J Complex Netw 7(5):764\u2013791. https:\/\/doi.org\/10.1093\/comnet\/cnz005","journal-title":"J Complex Netw"},{"key":"410_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/352\/06369","volume":"352","author":"A Kosowski","year":"2004","unstructured":"Kosowski A, Manuszewski K (2004) Classical coloring of graphs. Contemp Math 352:1\u201320","journal-title":"Contemp Math"},{"issue":"1","key":"410_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-014-5115-7","volume":"58","author":"L Kuang","year":"2015","unstructured":"Kuang L, Zheng B, Li D, Li Y, Sun Y (2015) A fractal and scale-free model of complex networks with hub attraction behaviors. Sci China Inf Sci 58(1):1\u201310. https:\/\/doi.org\/10.1007\/s11432-014-5115-7","journal-title":"Sci China Inf Sci"},{"key":"410_CR18","doi-asserted-by":"publisher","unstructured":"Kuang L, Wang F, Li Y, Mao H, Lin M, Yu F (2015) A discrete particle swarm optimization box-covering algorithm for fractal dimension on complex networks. In: 2015 IEEE congress on evolutionary computation (CEC), pp 1396\u20131403. https:\/\/doi.org\/10.1109\/CEC.2015.7257051","DOI":"10.1109\/CEC.2015.7257051"},{"key":"410_CR19","doi-asserted-by":"publisher","unstructured":"Kuang L, Zhao Z, Wang F, Li Y, Yu F, Li Z (2014) A differential evolution box-covering algorithm for fractal dimension on complex networks. In: 2014 IEEE congress on evolutionary computation (CEC), pp 693\u2013699. https:\/\/doi.org\/10.1109\/CEC.2014.6900383","DOI":"10.1109\/CEC.2014.6900383"},{"key":"410_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207160.2017.1364370","volume":"95","author":"D Li","year":"2017","unstructured":"Li D, Wang X, Huang P (2017) A max\u2013min ant colony algorithm for fractal dimension of complex networks. Int J Comput Math 95:1\u201312. https:\/\/doi.org\/10.1080\/00207160.2017.1364370","journal-title":"Int J Comput Math"},{"key":"410_CR21","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.physa.2019.04.242","volume":"523","author":"H Liao","year":"2019","unstructured":"Liao H, Wu X, Wang B-H, Wu X, Zhou M (2019) Solving the speed and accuracy of box-covering problem in complex networks. Physica A 523:954\u2013963. https:\/\/doi.org\/10.1016\/j.physa.2019.04.242","journal-title":"Physica A"},{"issue":"2","key":"410_CR22","doi-asserted-by":"publisher","first-page":"023103","DOI":"10.1063\/1.4907557","volume":"25","author":"J-L Liu","year":"2015","unstructured":"Liu J-L, Yu Z-G, Anh V (2015) Determination of multifractal dimensions of complex networks by means of the sandbox algorithm. Chaos: An Interdiscip J Nonlinear Sci 25(2):023103. https:\/\/doi.org\/10.1063\/1.4907557","journal-title":"Chaos: An Interdiscip J Nonlinear Sci"},{"key":"410_CR23","first-page":"371","volume":"7","author":"M Locci","year":"2010","unstructured":"Locci M, Concas G, Tonelli R, Turnu I (2010) Three algorithms for analyzing fractal software networks. WSEAS Trans Inform Sci Appl 7:371\u2013380","journal-title":"WSEAS Trans Inform Sci Appl"},{"key":"410_CR24","volume-title":"The fractal geometry of nature","author":"BB Mandelbrot","year":"1982","unstructured":"Mandelbrot BB (1982) The fractal geometry of nature, vol 1. WH Freeman, New York"},{"key":"410_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-67044-3_1","volume-title":"Big data and social media analytics","author":"R Molontay","year":"2021","unstructured":"Molontay R, Nagy M (2021) Twenty years of network science: a bibliographic and co-authorship network analysis. In: Gandomi A, Haider M (eds) Big data and social media analytics. Springer, Wiesbaden, pp 1\u201324. https:\/\/doi.org\/10.1007\/978-3-030-67044-3_1"},{"key":"410_CR26","unstructured":"Nagy M (2018) Data-driven analysis of fractality and other characteristics of complex networks. Budapest University of Technology and Economics, Department of Stochastics"},{"key":"410_CR27","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841356","volume-title":"The structure and dynamics of networks","author":"M Newman","year":"2011","unstructured":"Newman M, Barab\u00e1si A-L, Watts DJ (2011) The structure and dynamics of networks. Princeton University Press, Princeton"},{"issue":"17","key":"410_CR28","doi-asserted-by":"publisher","first-page":"2050189","DOI":"10.1142\/S0217984920501894","volume":"34","author":"M Niu","year":"2020","unstructured":"Niu M, Li R (2020) Outside-in box covering method and information dimension of Sierpinski networks. Mod Phys Lett B 34(17):2050189. https:\/\/doi.org\/10.1142\/S0217984920501894","journal-title":"Mod Phys Lett B"},{"key":"410_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-90047-6","volume-title":"A survey of fractal dimensions of networks","author":"E Rosenberg","year":"2018","unstructured":"Rosenberg E (2018) A survey of fractal dimensions of networks. Springer, Cham"},{"key":"410_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43169-3","volume-title":"Fractal dimensions of networks","author":"E Rosenberg","year":"2020","unstructured":"Rosenberg E (2020) Fractal dimensions of networks. Springer, Cham"},{"key":"410_CR31","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Twenty-ninth AAAI conference on artificial intelligence. http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"6","key":"410_CR32","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1088\/1367-2630\/9\/6\/175","volume":"9","author":"HD Rozenfeld","year":"2007","unstructured":"Rozenfeld HD, Havlin S, Ben-Avraham D (2007) Fractal and transfractal recursive scale-free nets. New J Phys 9(6):175. https:\/\/doi.org\/10.1088\/1367-2630\/9\/6\/175","journal-title":"New J Phys"},{"key":"410_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.016707","author":"C Schneider","year":"2012","unstructured":"Schneider C, Kesselring T Jr, Herrmann HJ (2012) Box-covering algorithm for fractal dimension of complex networks. Phys Rev. https:\/\/doi.org\/10.1103\/PhysRevE.86.016707","journal-title":"Phys Rev"},{"issue":"7024","key":"410_CR34","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C Song","year":"2005","unstructured":"Song C, Havlin S, Makse HA (2005) Self-similarity of complex networks. Nature 433(7024):392\u2013395. https:\/\/doi.org\/10.1038\/nature03248","journal-title":"Nature"},{"issue":"4","key":"410_CR35","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1038\/nphys266","volume":"2","author":"C Song","year":"2006","unstructured":"Song C, Havlin S, Makse HA (2006) Origins of fractality in the growth of complex networks. Nat Phys 2(4):275\u2013281. https:\/\/doi.org\/10.1038\/nphys266","journal-title":"Nat Phys"},{"issue":"03","key":"410_CR36","doi-asserted-by":"publisher","first-page":"03006","DOI":"10.1088\/1742-5468\/2007\/03\/p03006","volume":"2007","author":"C Song","year":"2007","unstructured":"Song C, Gallos LK, Havlin S, Makse HA (2007) How to calculate the fractal dimension of a complex network: the box covering algorithm. J Stat Mech: Theory Exp 2007(03):03006. https:\/\/doi.org\/10.1088\/1742-5468\/2007\/03\/p03006","journal-title":"J Stat Mech: Theory Exp"},{"key":"410_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.89.042809","author":"Y Sun","year":"2014","unstructured":"Sun Y, Zhao Y (2014) Overlapping-box-covering method for the fractal dimension of complex networks. Phys Rev. https:\/\/doi.org\/10.1103\/PhysRevE.89.042809","journal-title":"Phys Rev"},{"issue":"2","key":"410_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0378-4371(89)90563-3","volume":"159","author":"T T\u00e9l","year":"1989","unstructured":"T\u00e9l T, F\u00fcl\u00f6p \u00c1, Vicsek T (1989) Determination of fractal dimensions for geometrical multifractals. Physica A 159(2):155\u2013166. https:\/\/doi.org\/10.1016\/0378-4371(89)90563-3","journal-title":"Physica A"},{"issue":"1","key":"410_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep41385","volume":"7","author":"L Wang","year":"2017","unstructured":"Wang L, Wang Q, Xi L, Chen J, Wang S, Bao L, Yu Z, Zhao L (2017) On the fractality of complex networks: covering problem. Algorithms and Ahlfors regularity. Sci Rep 7(1):1\u201315. https:\/\/doi.org\/10.1038\/srep41385","journal-title":"Sci Rep"},{"issue":"1","key":"410_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep03049","volume":"3","author":"D-J Wei","year":"2013","unstructured":"Wei D-J, Liu Q, Zhang H-X, Hu Y, Deng Y, Mahadevan S (2013) Box-covering algorithm for fractal dimension of weighted networks. Sci Rep 3(1):1\u20138. https:\/\/doi.org\/10.1038\/srep03049","journal-title":"Sci Rep"},{"issue":"6","key":"410_CR41","doi-asserted-by":"publisher","first-page":"063122","DOI":"10.1063\/1.5093174","volume":"29","author":"Z-W Wei","year":"2019","unstructured":"Wei Z-W, Wang B-H, Wu X-T, He Y, Liao H, Zhou M-Y (2019) Sampling-based box-covering algorithm for renormalization of networks. Chaos: An Interdiscip J Nonlinear Sci 29(6):063122. https:\/\/doi.org\/10.1063\/1.5093174","journal-title":"Chaos: An Interdiscip J Nonlinear Sci"},{"key":"410_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2021.02.001","author":"T Wen","year":"2021","unstructured":"Wen T, Cheong KH (2021) Invited review: the fractal dimension of complex networks: a review. Inform Fusion. https:\/\/doi.org\/10.1016\/j.inffus.2021.02.001","journal-title":"Inform Fusion"},{"key":"410_CR43","unstructured":"Wolfram Data Repository WR (2019a) Archaeoglobus fulgidus whole network. https:\/\/datarepository.wolframcloud.com\/resources\/Archaeoglobus-Fulgidus-Whole-Network\/"},{"key":"410_CR44","unstructured":"Wolfram Data\u00a0Repository WR (2019b) Escherichia Coli whole network. https:\/\/datarepository.wolframcloud.com\/resources\/Escherichia-Coli-Whole-Network"},{"key":"410_CR45","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.asoc.2017.07.034","volume":"61","author":"H Wu","year":"2017","unstructured":"Wu H, Kuang L, Wang F, Rao Q, Gong M, Li Y (2017) A multiobjective box-covering algorithm for fractal modularity on complex networks. Appl Soft Comput 61:294\u2013313. https:\/\/doi.org\/10.1016\/j.asoc.2017.07.034","journal-title":"Appl Soft Comput"},{"key":"410_CR46","doi-asserted-by":"publisher","first-page":"3121","DOI":"10.1109\/ACCESS.2017.2674021","volume":"5","author":"C Yuan","year":"2017","unstructured":"Yuan C, Zhao Z, Li R, Li M, Zhang H (2017) The emergence of scaling law, fractal patterns and small-world in wireless networks. IEEE Access 5:3121\u20133130. https:\/\/doi.org\/10.1109\/ACCESS.2017.2674021","journal-title":"IEEE Access"},{"key":"410_CR47","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.asoc.2014.08.019","volume":"25","author":"H Zhang","year":"2014","unstructured":"Zhang H, Hu Y, Lan X, Mahadevan S, Deng Y (2014) Fuzzy fractal dimension of complex networks. Appl Soft Comput 25:514\u2013518. https:\/\/doi.org\/10.1016\/j.asoc.2014.08.019","journal-title":"Appl Soft Comput"},{"key":"410_CR48","doi-asserted-by":"publisher","unstructured":"Zhang H, Wei D, Hu Y, Lan X, Deng Y (2016) Modeling the self-similarity in complex networks based on Coulomb\u2019s law. Commun Nonlinear Sci Numer Simul 35:97\u2013104. https:\/\/doi.org\/10.1016\/j.cnsns.2015.10.017","DOI":"10.1016\/j.cnsns.2015.10.017"},{"key":"410_CR49","doi-asserted-by":"publisher","unstructured":"Zhang J, Zhao H, Qi W (2017) Algorithm for calculating the fractal dimension of internet AS-level topology. In: International conference on geo-spatial knowledge and intelligence, pp 334\u2013342 . https:\/\/doi.org\/10.1007\/978-981-13-0896-3_33","DOI":"10.1007\/978-981-13-0896-3_33"},{"issue":"3","key":"410_CR50","doi-asserted-by":"publisher","first-page":"038901","DOI":"10.1088\/0256-307x\/33\/3\/038901","volume":"33","author":"W Zheng","year":"2016","unstructured":"Zheng W, Pan Q, Sun C, Deng Y-F, Zhao X-K, Kang Z (2016) Fractal analysis of mobile social networks. Chin Phys Lett 33(3):038901. https:\/\/doi.org\/10.1088\/0256-307x\/33\/3\/038901","journal-title":"Chin Phys Lett"},{"key":"410_CR51","doi-asserted-by":"publisher","first-page":"53274","DOI":"10.1109\/ACCESS.2020.2981044","volume":"8","author":"W Zheng","year":"2020","unstructured":"Zheng W, You Q, Liu F, Yang F, Fan X (2020) Fractal analysis of overlapping box covering algorithm for complex networks. IEEE Access 8:53274\u201353280. https:\/\/doi.org\/10.1109\/ACCESS.2020.2981044","journal-title":"IEEE Access"},{"issue":"2","key":"410_CR52","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/j.physa.2006.10.025","volume":"375","author":"W-X Zhou","year":"2007","unstructured":"Zhou W-X, Jiang Z-Q, Sornette D (2007) Exploring self-similarity of complex cellular networks: the edge-covering method with simulated annealing and log-periodic sampling. Physica A 375(2):741\u2013752. https:\/\/doi.org\/10.1016\/j.physa.2006.10.025","journal-title":"Physica A"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-021-00410-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-021-00410-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-021-00410-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T20:10:09Z","timestamp":1673381409000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-021-00410-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,30]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s41109-021-00410-6","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,30]]},"assertion":[{"value":"17 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2021","order":3,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"73"}}