{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:51:30Z","timestamp":1778086290712,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:00:00Z","timestamp":1637280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:00:00Z","timestamp":1637280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61861136005"],"award-info":[{"award-number":["61861136005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61851110763"],"award-info":[{"award-number":["61851110763"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71731001"],"award-info":[{"award-number":["71731001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00500-021-06475-w","type":"journal-article","created":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T14:02:31Z","timestamp":1637330551000},"page":"3107-3125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Efficient network dismantling through genetic algorithms"],"prefix":"10.1007","volume":"26","author":[{"given":"Wei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Wandelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8713-142X","authenticated-orcid":false,"given":"Xiaoqian","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,19]]},"reference":[{"issue":"4","key":"6475_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/TEVC.2003.814633","volume":"7","author":"CW Ahn","year":"2003","unstructured":"Ahn CW, Ramakrishna RS (2003) Elitism-based compact genetic algorithms. IEEE Trans Evol Comput 7(4):367\u2013385","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"6475_CR2","doi-asserted-by":"publisher","first-page":"025103","DOI":"10.1103\/PhysRevE.69.025103","volume":"69","author":"R Albert","year":"2004","unstructured":"Albert R, Albert I, Nakarado GL (2004) Structural vulnerability of the north american power grid. Phys Rev E 69(2):025103","journal-title":"Phys Rev E"},{"issue":"1","key":"6475_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"key":"6475_CR4","unstructured":"Alsabti K, Ranka S, Singh V (1997) An efficient k-means clustering algorithm"},{"key":"6475_CR5","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/j.physa.2006.12.058","volume":"380","author":"J Ash","year":"2007","unstructured":"Ash J, Newth D (2007) Optimizing complex networks for resilience against cascading failure. Physica A 380:673\u2013683","journal-title":"Physica A"},{"key":"6475_CR6","unstructured":"Baker JE et al (1987) Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the second international conference on genetic algorithms 206:14\u201321"},{"issue":"1","key":"6475_CR7","first-page":"2653","volume":"18","author":"A Benavoli","year":"2017","unstructured":"Benavoli A, Corani G, Dem\u0161ar J, Zaffalon M (2017) Time for a change: a tutorial for comparing multiple classifiers through bayesian analysis. J Mach Learn Res 18(1):2653\u20132688","journal-title":"J Mach Learn Res"},{"issue":"1","key":"6475_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2(1):113\u2013120","journal-title":"J Math Sociol"},{"issue":"2","key":"6475_CR9","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":"6475_CR10","doi-asserted-by":"crossref","unstructured":"Braunstein A, Dall\u2019Asta L, Semerjian G, Zdeborov\u00e1 L (2016) Network dismantling. Proc Natl Acad Sci 113(44):12368\u201312373","DOI":"10.1073\/pnas.1605083113"},{"issue":"3","key":"6475_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1111\/j.1740-9713.2010.00436.x","volume":"7","author":"P Brooker","year":"2010","unstructured":"Brooker P (2010) Fear in a handful of dust: aviation and the icelandic volcano. Significance 7(3):112\u2013115","journal-title":"Significance"},{"key":"6475_CR12","doi-asserted-by":"publisher","first-page":"8569","DOI":"10.1007\/s00500-019-04428-y","volume":"24","author":"R Cerqueti","year":"2020","unstructured":"Cerqueti R, Clemente GP, Grassi R (2020) Influence measures in subnetworks using vertex centrality. Soft Comput 24:8569\u20138582","journal-title":"Soft Comput"},{"key":"6475_CR13","doi-asserted-by":"publisher","first-page":"13687","DOI":"10.1007\/s00500-019-04470-w","volume":"24","author":"GP Clemente","year":"2020","unstructured":"Clemente GP, Cornaro A (2020) A novel measure of edge and vertex centrality for assessing robustness in complex networks. Soft Comput 24:13687\u201313704","journal-title":"Soft Comput"},{"issue":"7","key":"6475_CR14","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1073\/pnas.0510525103","volume":"103","author":"V Colizza","year":"2006","unstructured":"Colizza V, Barrat A, Barth\u00e9lemy M, Vespignani A (2006) The role of the airline transportation network in the prediction and predictability of global epidemics. Proc Natl Acad Sci 103(7):2015\u20132020","journal-title":"Proc Natl Acad Sci"},{"key":"6475_CR15","doi-asserted-by":"crossref","unstructured":"Conchon, S., Filli\u00e2tre, J.-C.: A persistent union-find data structure. In Proceedings of the 2007 workshop on Workshop on ML, pages 37\u201346, (2007)","DOI":"10.1145\/1292535.1292541"},{"key":"6475_CR16","unstructured":"Corsi, S., Sabelli, C.: General blackout in italy sunday september 28, 2003, h. 03: 28: 00. In: IEEE Power Engineering Society General Meeting, 2004, pages 1691\u20131702. IEEE, (2004)"},{"issue":"9","key":"6475_CR17","doi-asserted-by":"publisher","first-page":"9211","DOI":"10.3390\/en8099211","volume":"8","author":"L Cuadra","year":"2015","unstructured":"Cuadra L, Salcedo-Sanz S, Del Ser J, Jim\u00e9nez-Fern\u00e1ndez S, Geem ZW (2015) A critical review of robustness in power grids using complex networks concepts. Energies 8(9):9211\u20139265","journal-title":"Energies"},{"key":"6475_CR18","doi-asserted-by":"publisher","first-page":"3569","DOI":"10.1007\/s00500-019-04125-w","volume":"24","author":"ZA Dahi","year":"2020","unstructured":"Dahi ZA, Alba E (2020) The grid-to-neighbourhood relationship in cellular gas: from design to solving complex problems. Soft Comput 24:3569\u20133589","journal-title":"Soft Comput"},{"key":"6475_CR19","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"6475_CR20","doi-asserted-by":"publisher","first-page":"4238","DOI":"10.1038\/srep04238","volume":"4","author":"PA Duijn","year":"2014","unstructured":"Duijn PA, Kashirin V, Sloot PM (2014) The relative ineffectiveness of criminal network disruption. Sci Rep 4:4238","journal-title":"Sci Rep"},{"key":"6475_CR21","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry, pages 35\u201341","DOI":"10.2307\/3033543"},{"issue":"6","key":"6475_CR22","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1086\/229694","volume":"96","author":"NE Friedkin","year":"1991","unstructured":"Friedkin NE (1991) Theoretical foundations for centrality measures. Am J Sociol 96(6):1478\u20131504","journal-title":"Am J Sociol"},{"issue":"10","key":"6475_CR23","doi-asserted-by":"publisher","first-page":"12187","DOI":"10.3390\/en81012187","volume":"8","author":"J Gao","year":"2015","unstructured":"Gao J, Liu X, Li D, Havlin S (2015) Recent progress on the resilience of complex networks. Energies 8(10):12187\u201312210","journal-title":"Energies"},{"issue":"5","key":"6475_CR24","doi-asserted-by":"publisher","first-page":"056109","DOI":"10.1103\/PhysRevE.65.056109","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme P, Kim BJ, Yoon CN, Han SK (2002) Attack vulnerability of complex networks. Phys Rev E 65(5):056109","journal-title":"Phys Rev E"},{"issue":"1","key":"6475_CR25","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":"1","key":"6475_CR26","doi-asserted-by":"publisher","first-page":"012309","DOI":"10.1103\/PhysRevE.97.012309","volume":"97","author":"M Kitsak","year":"2018","unstructured":"Kitsak M, Ganin AA, Eisenberg DA, Krapivsky PL, Krioukov D, Alderson DL, Linkov I (2018) Stability of a giant connected component in a complex network. Phys Rev E 97(1):012309","journal-title":"Phys Rev E"},{"key":"6475_CR27","doi-asserted-by":"crossref","unstructured":"Lerman K, Ghosh R (2010) Information contagion: An empirical study of the spread of news on digg and twitter social networks. arXiv preprint arXiv:1003.2664","DOI":"10.1609\/icwsm.v4i1.14021"},{"issue":"10","key":"6475_CR28","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1038\/nbt.1567","volume":"27","author":"D Merico","year":"2009","unstructured":"Merico D, Gfeller D, Bader GD (2009) How to visually interpret biological data using networks. Nat Biotechnol 27(10):921\u2013924","journal-title":"Nat Biotechnol"},{"issue":"7563","key":"6475_CR29","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65\u201368","journal-title":"Nature"},{"key":"6475_CR30","doi-asserted-by":"publisher","first-page":"30062","DOI":"10.1038\/srep30062","volume":"6","author":"F Morone","year":"2016","unstructured":"Morone F, Min B, Bo L, Mari R, Makse HA (2016) Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci Rep 6:30062","journal-title":"Sci Rep"},{"key":"6475_CR31","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab"},{"issue":"1\u20132","key":"6475_CR32","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1504\/IJCIS.2008.016091","volume":"4","author":"K Peters","year":"2008","unstructured":"Peters K, Buzna L, Helbing D (2008) Modelling of cascading effects and efficient response to disaster spreading in complex networks. Int J Crit Infrastruct 4(1\u20132):46\u201362","journal-title":"Int J Crit Infrastruct"},{"issue":"14","key":"6475_CR33","doi-asserted-by":"publisher","first-page":"6554","DOI":"10.1073\/pnas.1806108116","volume":"116","author":"X-L Ren","year":"2019","unstructured":"Ren X-L, Gleinig N, Helbing D, Antulov-Fantulin N (2019) Generalized network dismantling. Proc Natl Acad Sci 116(14):6554\u20136559","journal-title":"Proc Natl Acad Sci"},{"key":"6475_CR34","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In AAAI","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"4","key":"6475_CR35","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":"10","key":"6475_CR36","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"Schneider CM, Moreira AA, Andrade JS, Havlin S, Herrmann HJ (2011) Mitigation of malicious attacks on networks. Proc Natl Acad Sci 108(10):3838\u20133841","journal-title":"Proc Natl Acad Sci"},{"key":"6475_CR37","doi-asserted-by":"publisher","first-page":"13441","DOI":"10.1007\/s00500-020-04759-1","volume":"24","author":"W Shi","year":"2020","unstructured":"Shi W, Long Xiaoqiu, Li Y, Deng D, Wei Y (2020) Research on the performance of multi-population genetic algorithms with different complex network structures. Soft Comput 24:13441\u201313459","journal-title":"Soft Comput"},{"key":"6475_CR38","doi-asserted-by":"crossref","unstructured":"Smith J, Fogarty TC (1996) Self adaptation of mutation rates in a steady state genetic algorithm. In Proceedings of IEEE international conference on evolutionary computation, pages 318\u2013323. IEEE","DOI":"10.1109\/ICEC.1996.542382"},{"issue":"6825","key":"6475_CR39","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410(6825):268\u2013276","journal-title":"Nature"},{"issue":"2","key":"6475_CR40","first-page":"153","volume":"3","author":"X Sun","year":"2015","unstructured":"Sun X, Wandelt S, Linke F (2015) Temporal evolution analysis of the european air transportation system: air navigation route network and airport network. Transportmetrica B: Transport Dynamics 3(2):153\u2013168","journal-title":"Transportmetrica B: Transport Dynamics"},{"key":"6475_CR41","doi-asserted-by":"crossref","unstructured":"Tarjan RE, Vishkin U (1985) An efficient parallel biconnectivity algorithm. SIAM J Comput 14(4):862\u2013874","DOI":"10.1137\/0214061"},{"issue":"1","key":"6475_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-016-0009-6","volume":"8","author":"L Tian","year":"2017","unstructured":"Tian L, Bashan A, Shi D-N, Liu Y-Y (2017) Articulation points in complex networks. Nat Commun 8(1):1\u20139","journal-title":"Nat Commun"},{"key":"6475_CR43","doi-asserted-by":"publisher","first-page":"107307","DOI":"10.1016\/j.ress.2020.107307","volume":"206","author":"S Wandelt","year":"2021","unstructured":"Wandelt S, Shi X, Sun X (2021) Estimation and improvement of transportation network robustness by exploiting communities. Reliabil Eng Syst Safe 206:107307","journal-title":"Reliabil Eng Syst Safe"},{"issue":"1","key":"6475_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-018-31902-8","volume":"8","author":"S Wandelt","year":"2018","unstructured":"Wandelt S, Sun X, Feng D, Zanin M, Havlin S (2018) A comparative analysis of approaches to network-dismantling. Sci Rep 8(1):1\u201315","journal-title":"Sci Rep"},{"key":"6475_CR45","first-page":"02","volume":"83","author":"S Wandelt","year":"2017","unstructured":"Wandelt S, Sun X, Zanin M, Havlin S (2017) QRE: quick Robustness Estimation for large complex networks. Futur Gener Comput Syst 83:02","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"6475_CR46","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65\u201385","journal-title":"Stat Comput"},{"key":"6475_CR47","doi-asserted-by":"crossref","unstructured":"Yook S-H, Jeong H, Barab\u00e1si A-L (2002) Modeling the internets large-scale topology. Proc Natl Acad Sci 99(21):13382\u201313386","DOI":"10.1073\/pnas.172501399"},{"key":"6475_CR48","doi-asserted-by":"publisher","first-page":"6135","DOI":"10.1007\/s00500-018-3267-x","volume":"23","author":"KR Zalik","year":"2019","unstructured":"Zalik KR, Zalik B (2019) Node attraction-facilitated evolution algorithm for community detection in networks. Soft Comput 23:6135\u20136143","journal-title":"Soft Comput"},{"issue":"1","key":"6475_CR49","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1140\/epjst\/e2013-01711-9","volume":"215","author":"M Zanin","year":"2013","unstructured":"Zanin M, Lillo F (2013) Modelling the air transport with complex networks: a short review. Eur Physic J Special Topics 215(1):5\u201321","journal-title":"Eur Physic J Special Topics"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06475-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06475-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06475-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T17:43:04Z","timestamp":1726162984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06475-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,19]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["6475"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06475-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,19]]},"assertion":[{"value":"16 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author Wei Lin declares that he has no conflict of interest. Author Sebastian Wandelt declares that he has no conflict of interest. Author Xiaoqian Sun declares that she has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The code underlying this study are available from the corresponding author upon reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}