{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:08:05Z","timestamp":1742944085450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030446840"},{"type":"electronic","value":"9783030446857"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-44685-7_3","type":"book-chapter","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T14:07:01Z","timestamp":1595426821000},"page":"63-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Vulnerability Evaluation of Networks to Multiple Failures Based on Critical Nodes and Links"],"prefix":"10.1007","author":[{"given":"Amaro","family":"de Sousa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorabella","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,23]]},"reference":[{"issue":"1\u20132","key":"3_CR1","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10479-016-2110-y","volume":"238","author":"B Addis","year":"2016","unstructured":"Addis B, Aringhieri R, Grosso A, Hosteins P (2016) Hybrid constructive heuristics for the critical node problem. Ann Oper Res 238(1\u20132):637\u2013649","journal-title":"Ann Oper Res"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan A, Commander CW, Elefteriadou L, Pardalos PM (2009) Detecting critical nodes in sparse graphs. Comput Oper Res 36:2193\u20132200","journal-title":"Comput Oper Res"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Barbosa F, de Sousa A, Agra A (2018) Topology design of transparent optical networks resilient to multiple node failures. In: 10th International Workshop on Resilient Networks Design and Modeling (RNDM), Longyearbyen, Norway, pp 1\u20138","DOI":"10.1109\/RNDM.2018.8489825"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","volume":"53","author":"M Di Summa","year":"2012","unstructured":"Di Summa M, Grosso A, Locatelli M (2012) Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput Optim Appl 53(3):649\u2013680","journal-title":"Comput Optim Appl"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1109\/TNET.2014.2317486","volume":"23","author":"TN Dinh","year":"2015","unstructured":"Dinh TN, Thai MT (2015) Network under joint node and link attacks: vulnerability assessment methods and analysis. IEEE\/ACM Trans Netw 23(3):1001\u20131011","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","volume":"20","author":"TN Dinh","year":"2012","unstructured":"Dinh TN, Xuan Y, Thai MT, Pardalos PM, Znati T (2012) On new approaches of assessing network vulnerability: hardness and approximation. IEEE\/ACM Trans Netw 20(2):609\u2013619","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0059613","volume":"8","author":"S Iyer","year":"2013","unstructured":"Iyer S, Killingback T, Sundaram B, Wang Z (2013) Attack robustness and centrality of complex networks. PLoS ONE 8(4):1\u201317","journal-title":"PLoS ONE"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cosrev.2018.02.002","volume":"28","author":"M Lalou","year":"2018","unstructured":"Lalou M, Tahraouic MA, Kheddouci H (2018) The critical node detection problem in networks: a survey. Comput Sci Rev 28:92\u2013117","journal-title":"Comput Sci Rev"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.cor.2015.11.001","volume":"69","author":"AK Nandi","year":"2016","unstructured":"Nandi AK, Medal HR (2016) Methods for removing links in a network to minimize the spread of infections. Comput Oper Res 69:10\u201324","journal-title":"Comput Oper Res"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Natalino C, de Sousa A, Wosinska L, Furdek M (2018) On the trade-offs between user-to-replica distance and CDN robustness to link cut attacks. In: 10th International Workshop on Resilient Networks Design and Modeling (RNDM), Longyearbyen, Norway, pp 1\u20137","DOI":"10.1109\/RNDM.2018.8489838"},{"issue":"3","key":"3_CR11","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski S, Wess\u00e4ly R, Pi\u00f3ro M, Tomaszewski A (2010) SNDlib 1.0\u2013survivable network design library. Networks 55(3):276\u2013286","journal-title":"Networks"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Paudel N, Georgiadis L, Italiano GF (2018) Computing critical nodes in directed graphs. J Exp Algorithmics 23(2), Article 2.2","DOI":"10.1145\/3228332"},{"key":"3_CR13","unstructured":"Rochat Y (2009) Closeness centrality extended to unconnected graphs: the harmonic centrality index. Applications of Social Network Analysis. http:\/\/infoscience.epfl.ch\/record\/200525"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10922-016-9391-y","volume":"25","author":"D Rueda","year":"2017","unstructured":"Rueda D, Calle E, Marzo JL (2017) Robustness comparison of 15 real telecommunication networks: structural and centrality measurements. J Netw Syst Manage 25(2):269\u2013289","journal-title":"J Netw Syst Manage"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.endm.2018.02.007","volume":"64","author":"D Santos","year":"2018","unstructured":"Santos D, de Sousa A, Monteiro P (2018) Compact models for critical node detection in telecommunication networks. Electron Notes Discrete Math 64:325\u2013334","journal-title":"Electron Notes Discrete Math"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05227-4","volume-title":"Optical network design and planning","author":"J Simmons","year":"2014","unstructured":"Simmons J (2014) Optical network design and planning, 2nd edn. Springer, Cham","edition":"2"},{"issue":"11","key":"3_CR17","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","volume":"39","author":"M Ventresca","year":"2012","unstructured":"Ventresca M (2012) Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput Oper Res 39(11):2763\u20132775","journal-title":"Comput Oper Res"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s11590-013-0666-x","volume":"8","author":"A Veremyev","year":"2014","unstructured":"Veremyev A, Boginski V, Pasiliao E (2014) Exact identification of critical nodes in sparse networks via new compact formulations. Optim Lett 8:1245\u20131259","journal-title":"Optim Lett"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.21622","volume":"66","author":"A Veremyev","year":"2015","unstructured":"Veremyev A, Prokopyev O, Pasiliao E (2015) Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3):170\u2013195","journal-title":"Networks"}],"container-title":["Computer Communications and Networks","Guide to Disaster-Resilient Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44685-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T17:27:20Z","timestamp":1696440440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44685-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030446840","9783030446857"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44685-7_3","relation":{},"ISSN":["1617-7975","2197-8433"],"issn-type":[{"type":"print","value":"1617-7975"},{"type":"electronic","value":"2197-8433"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}