{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:04:22Z","timestamp":1767211462526,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,29]],"date-time":"2014-04-29T00:00:00Z","timestamp":1398729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10878-014-9742-0","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T09:06:14Z","timestamp":1398675974000},"page":"3-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Bound and exact methods for assessing link vulnerability in complex networks"],"prefix":"10.1007","volume":"28","author":[{"given":"T. N.","family":"Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,29]]},"reference":[{"key":"9742_CR1","doi-asserted-by":"crossref","unstructured":"Addis B, Summa MD, Grosso A (2013) Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Appl Math 161(1617):2349\u20132360. doi: 10.1016\/j.dam.2013.03.021 . URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X13001686","DOI":"10.1016\/j.dam.2013.03.021"},{"issue":"2","key":"9742_CR2","doi-asserted-by":"crossref","first-page":"10","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):10","journal-title":"Phys Rev E"},{"issue":"6794","key":"9742_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382. doi: 10.1038\/35019019","journal-title":"Nature"},{"issue":"7","key":"9742_CR4","doi-asserted-by":"crossref","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(7):2193\u20132200. doi: 10.1016\/j.cor.2008.08.016","journal-title":"Comput Oper Res"},{"key":"9742_CR5","doi-asserted-by":"crossref","unstructured":"Banerjee S, Shirazipourazad S, Sen A (2011) Design and analysis of networks with large components in presence of region-based faults. In: IEEE international conference on communications (ICC), 2011, pp 1\u20136. doi: 10.1109\/icc.2011.5962427","DOI":"10.1109\/icc.2011.5962427"},{"key":"9742_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0378-4371(00)00018-2","volume":"281","author":"A Barabasi","year":"2000","unstructured":"Barabasi A, Albert R, Jeong H (2000) Scale-free characteristics of random networks: the topology of the world-wide web. Physica 281:69\u201377","journal-title":"Physica"},{"issue":"2","key":"9742_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10878-012-9469-8","volume":"25","author":"C Bazgan","year":"2013","unstructured":"Bazgan C, Toubaline S, Vanderpooten D (2013) Complexity of determining the most vital elements for the p-median and p-center location problems. J Comb Optim 25(2):191\u2013207. doi: 10.1007\/s10878-012-9469-8","journal-title":"J Comb Optim"},{"issue":"1","key":"9742_CR8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10878-011-9449-4","volume":"26","author":"C Bazgan","year":"2013","unstructured":"Bazgan C, Toubaline S, Vanderpooten D (2013) Critical edges\/nodes for the minimum spanning tree problem: complexity and approximation. J Comb Optim 26(1):178\u2013189. doi: 10.1007\/s10878-011-9449-4","journal-title":"J Comb Optim"},{"key":"9742_CR9","doi-asserted-by":"crossref","unstructured":"Bissias G, Levine BN, Rosenberg AL (2007) Bounding damage from link destruction with application to the internet (extended abstract). In: Proc. ACM SIGMETRICS, pp 367\u2013368. http:\/\/prisms.cs.umass.edu\/brian\/pubs\/bissias.sigmetrics.abstract.2007.pdf","DOI":"10.1145\/1254882.1254933"},{"key":"9742_CR10","unstructured":"Bissias GD (2010) Bounds on service quality for networks subject to augmentation and attack. Ph.D. thesis, University of Massachusetts Amherst"},{"key":"9742_CR11","doi-asserted-by":"crossref","unstructured":"Blackford LS, Choi J, Cleary A, D\u2019Azeuedo E, Demmel J, Dhillon I, Hammarling S, Henry G, Petitet A, Stanley K, Walker D, Whaley RC (1997) ScaLAPACK user\u2019s guide. SIAM","DOI":"10.1137\/1.9780898719642"},{"issue":"1","key":"9742_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP (2006) Identifying sets of key players in a social network. Comput Math Organ Theory 12(1):21\u201334. doi: 10.1007\/s10588-006-7084-x","journal-title":"Comput Math Organ Theory"},{"key":"9742_CR13","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press. http:\/\/books.google.com\/books?id=mYm0bLd3fcoC","DOI":"10.1017\/CBO9780511804441"},{"key":"9742_CR14","unstructured":"Chung FRK (1997) Spectral graph theory (CBMS regional conference series in mathematics, No. 92). American Mathematical Society, Providence. http:\/\/www.amazon.com\/exec\/obidos\/redirect?tag=citeulike07-20&path=ASIN\/0821803158"},{"issue":"3","key":"9742_CR15","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","volume":"53","author":"M Summa Di","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. doi: 10.1007\/s10589-012-9458-y","journal-title":"Comput Optim Appl"},{"key":"9742_CR16","doi-asserted-by":"crossref","unstructured":"Dinh TN, Thai MT (2011) Precise structural vulnerability assessment via mathematical programming. In: Proc. of IEEE MILCOM","DOI":"10.1109\/MILCOM.2011.6127492"},{"key":"9742_CR17","first-page":"00","volume":"99","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Thai MT (2014) Network under joint node and link attacks: vulnerability assessment methods and analysis. IEEE\/ACM Trans Netw 99:00\u201312. doi: 10.1109\/TNET.2011.2170849","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9742_CR18","first-page":"2678","volume-title":"INFOCOM","author":"TN Dinh","year":"2010","unstructured":"Dinh TN, Xuan Y, Thai MT, Park EK, Znati T (2010) On approximation of new optimization methods for assessing network vulnerability. INFOCOM. IEEE Press, Piscataway, pp 2678\u20132686"},{"key":"9742_CR19","doi-asserted-by":"crossref","unstructured":"Donath WE, Hoffman AJ (1973) Lower bounds for the partitioning of graphs. IBM J Res Dev 17. doi: 10.1147\/rd.175.0420 . http:\/\/dx.doi.org\/10.1147\/rd.175.0420","DOI":"10.1147\/rd.175.0420"},{"key":"9742_CR20","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hungary Acad Sci 5:17\u201361","journal-title":"Publ Math Inst Hungary Acad Sci"},{"key":"9742_CR21","doi-asserted-by":"crossref","unstructured":"Goldberg AV, Tarjan RE (1986) A new approach to the maximum flow problem. In: Proceedings of the eighteenth annual ACM symposium on theory of computing, STOC \u201986, pp 136\u2013146. ACM, New York, NY, USA. doi: 10.1145\/12130.12144 . http:\/\/doi.acm.org\/10.1145\/12130.12144","DOI":"10.1145\/12130.12144"},{"key":"9742_CR22","doi-asserted-by":"crossref","unstructured":"Grubesic TH, Matisziw TC, Murray AT, Snediker D (2008) Comparative approaches for assessing network vulnerability. Int Reg Sci Rev 31. doi: 10.1177\/0160017607308679","DOI":"10.1177\/0160017607308679"},{"key":"9742_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, ACM, pp 177\u2013187. doi: 10.1145\/1081870.1081893","DOI":"10.1145\/1081870.1081893"},{"key":"9742_CR24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"TC Matisziw","year":"2009","unstructured":"Matisziw TC, Murray AT (2009) Modeling s\u2013t path availability to support disaster vulnerability assessment of network infrastructure. Comput Oper Res 36:16\u201326. doi: 10.1016\/j.cor.2007.09.004","journal-title":"Comput Oper Res"},{"key":"9742_CR25","doi-asserted-by":"crossref","unstructured":"Mohar B, Poljak S (1992) Eigenvalue in combinatorial optimization. In: Combinatorial and graph\u2013theoretical problems in linear algebra","DOI":"10.1007\/978-1-4613-8354-3_5"},{"issue":"4","key":"9742_CR26","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1111\/j.1468-2257.2008.00447.x","volume":"39","author":"AT Murray","year":"2008","unstructured":"Murray AT, Matisziw TC, Grubesic TH (2008) A methodological overview of network vulnerability analysis. Growth Change 39(4):573\u2013592. doi: 10.1111\/j.1468-2257.2008.00447.x","journal-title":"Growth Change"},{"key":"9742_CR27","doi-asserted-by":"crossref","unstructured":"Neumayer S, Zussman G, Cohen R, Modiano E (2011) Assessing the vulnerability of the fiber infrastructure to disasters. IEEE\/ACM Trans Netw 1610\u20131623","DOI":"10.1109\/TNET.2011.2128879"},{"issue":"1","key":"9742_CR28","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1111\/j.1467-9574.2007.00350.x","volume":"61","author":"M Oosten","year":"2007","unstructured":"Oosten M, Rutten JHGC, Spieksma FCR (2007) Disconnecting graphs by removing vertices: a polyhedral approach. Stat Neerl 61(1):35\u201360. doi: 10.1111\/j.1467-9574.2007.00350.x","journal-title":"Stat Neerl"},{"key":"9742_CR29","doi-asserted-by":"crossref","unstructured":"Sen A, Murthy S, Banerjee S (2009) Region-based connectivity\u2014a new paradigm for design of fault-tolerant networks. In: HPSR","DOI":"10.1109\/HPSR.2009.5307417"},{"issue":"2","key":"9742_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.20464","volume":"60","author":"S Shen","year":"2012","unstructured":"Shen S, Smith JC (2012) Polynomial-time algorithms for solving a class of critical node problems on trees and series\u2013parallel graphs. Networks 60(2):103\u2013119. doi: 10.1002\/net.20464","journal-title":"Networks"},{"key":"9742_CR31","doi-asserted-by":"crossref","unstructured":"Shen Y, Dinh T, Thai M (2012) Adaptive algorithms for detecting critical links and nodes in dynamic networks. In: Military communications conference, 2012\u2014MILCOM 2012, pp 1\u20136. doi: 10.1109\/MILCOM.2012.6415629","DOI":"10.1109\/MILCOM.2012.6415629"},{"issue":"3","key":"9742_CR32","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/TNET.2012.2215882","volume":"21","author":"Y Shen","year":"2013","unstructured":"Shen Y, Nguyen NP, Xuan Y, Thai MT (2013) On the discovery of critical links and nodes for assessing network vulnerability. IEEE\/ACM Trans Netw 21(3):963\u2013973. doi: 10.1109\/TNET.2012.2215882","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"9742_CR33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10878-007-9120-2","volume":"16","author":"B Su","year":"2008","unstructured":"Su B, Xu Q, Xiao P (2008) Finding the anti-block vital edge of a shortest path between two nodes. J Comb Optim 16(2):173\u2013181. doi: 10.1007\/s10878-007-9120-2","journal-title":"J Comb Optim"},{"key":"9742_CR34","doi-asserted-by":"crossref","unstructured":"Ventresca M, Aleman D (2014) A derandomized approximation algorithm for the critical node detection problem. Comput Oper Res 43(0):261\u2013270. doi: 10.1016\/j.cor.2013.09.012 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054813002827","DOI":"10.1016\/j.cor.2013.09.012"},{"issue":"4","key":"9742_CR35","doi-asserted-by":"crossref","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(4):1245\u20131259. doi: 10.1007\/s11590-013-0666-x","journal-title":"Optim Lett"},{"issue":"6684","key":"9742_CR36","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393(6684):440\u2013442. doi: 10.1038\/30918","journal-title":"Nature"},{"key":"9742_CR37","doi-asserted-by":"crossref","unstructured":"White S, Smyth P (2005) A spectral clustering approach to finding communities in graph. In: SDM","DOI":"10.1137\/1.9781611972757.25"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9742-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9742-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9742-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T12:40:45Z","timestamp":1597754445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9742-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,29]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9742"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9742-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2014,4,29]]}}}