{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:17:39Z","timestamp":1773778659952,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/tnet.2011.2170849","type":"journal-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T19:25:29Z","timestamp":1318965929000},"page":"609-619","source":"Crossref","is-referenced-by-count":120,"title":["On New Approaches of Assessing Network Vulnerability: Hardness and Approximation"],"prefix":"10.1109","volume":"20","author":[{"given":"Thang N.","family":"Dinh","sequence":"first","affiliation":[]},{"given":"Ying","family":"Xuan","sequence":"additional","affiliation":[]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Taieb","family":"Znati","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"360","article-title":"Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks","author":"jorgic","year":"2004","journal-title":"Proc 2nd IFIP MED-HOC-NET Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(00)00018-2"},{"key":"ref12","author":"suh","year":"2009","journal-title":"Method for supporting quality of service in heterogeneous networks"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1607870"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1313223"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1504\/IJSN.2007.012823"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-006-7084-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"ref19","first-page":"744","article-title":"Between min cut and graph bisection","author":"wagner","year":"1993","journal-title":"Proc MFCS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2009.5307417"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-2257.2008.00447.x"},{"key":"ref6","author":"colbourn","year":"1987","journal-title":"The Combinatorics of Network Reliability"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062074"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2002.1021729"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.11.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8306.2004.00410.x"},{"key":"ref9","first-page":"15","article-title":"Partition detection in mobile ad hoc networks using multiple disjoint paths set","author":"hauspie","year":"2003","journal-title":"Proc Workshop Objects Models Multimedia Technol"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0160017607308679"},{"key":"ref20","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060675"},{"key":"ref21","first-page":"2005","article-title":"On the hardness of approximating minimum vertex cover","volume":"162","author":"dinur","year":"2004","journal-title":"Ann Math"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347478"},{"key":"ref26","author":"page","year":"1999","journal-title":"The PageRank Citation Ranking Bringing Order to the Web"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6183048\/06051504.pdf?arnumber=6051504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:32Z","timestamp":1633909952000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6051504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":26,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2011.2170849","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}