{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:40:16Z","timestamp":1763642416575,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920573"},{"type":"electronic","value":"9783319920580"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92058-0_42","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T16:59:16Z","timestamp":1527613156000},"page":"434-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Scale-Free Network Robustness with the Great Deluge Algorithm"],"prefix":"10.1007","author":[{"given":"James","family":"Paterson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatrice","family":"Ombuki-Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"issue":"01","key":"42_CR1","doi-asserted-by":"publisher","first-page":"P01027","DOI":"10.1088\/1742-5468\/2011\/01\/P01027","volume":"2011","author":"HJ Herrmann","year":"2011","unstructured":"Herrmann, H.J., Schneider, C.M., Moreira, A.A., Andrade Jr., J.S., Havlin, S.: Onion-like network topology enhances robustness against malicious attacks. J. Stat. Mech. Theor. Exp. 2011(01), P01027 (2011)","journal-title":"J. Stat. Mech. Theor. Exp."},{"issue":"16","key":"42_CR2","doi-asserted-by":"publisher","first-page":"3682","DOI":"10.1103\/PhysRevLett.86.3682","volume":"86","author":"R Cohen","year":"2001","unstructured":"Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86(16), 3682 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"42_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.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-20267-4_18","volume-title":"Adaptive and Natural Computing Algorithms","author":"P Buesser","year":"2011","unstructured":"Buesser, P., Daolio, F., Tomassini, M.: Optimizing the robustness of scale-free networks with simulated annealing. In: Dobnikar, A., Lotri\u010d, U., \u0160ter, B. (eds.) ICANNGA 2011. LNCS, vol. 6594, pp. 167\u2013176. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20267-4_18"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-15916-4","volume-title":"Propagation Phenomena in Real World Networks","author":"VH Louzada","year":"2015","unstructured":"Louzada, V.H., Daolio, F., Herrmann, H.J., Tomassini, M.: Generating robust and efficient networks under targeted attacks. In: Kr\u00f3l, D., Fay, D., Gabry\u015b, B. (eds.) Propagation Phenomena in Real World Networks, pp. 215\u2013224. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15916-4"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.physa.2014.05.002","volume":"410","author":"M Zhou","year":"2014","unstructured":"Zhou, M., Liu, J.: A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks. Phys. A Stat. Mech. Appl. 410, 131\u2013143 (2014)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"L\u00fc, J., Chen, G., Ogorzalek, M.J., Trajkovi\u0107, L.: Theory and applications of complex networks: advances and challenges. In: 2013 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2291\u20132294. IEEE (2013)","DOI":"10.1109\/ISCAS.2013.6572335"},{"issue":"10","key":"42_CR9","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"Schneider, C.M., Moreira, A.A., Andrade, J.S., Havlin, S., Herrmann, H.J.: Mitigation of malicious attacks on networks. Proc. Natl. Acad. Sci. 108(10), 3838\u20133841 (2011)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"42_CR10","unstructured":"Cs\u00e1rdi, G., Nepusz, T. http:\/\/igraph.org\/python\/"}],"container-title":["Lecture Notes in Computer Science","Recent Trends and Future Technology in Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92058-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:46:42Z","timestamp":1751662002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92058-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920573","9783319920580"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92058-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}