{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:51:26Z","timestamp":1729626686987,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/rndm.2017.8093016","type":"proceedings-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T04:12:36Z","timestamp":1509682356000},"page":"1-7","source":"Crossref","is-referenced-by-count":10,"title":["Building uniformly most-reliable networks by iterative augmentation"],"prefix":"10.1109","author":[{"given":"Pablo","family":"Romero","sequence":"first","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/2684083.2684095"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/S0095-8956(81)80028-7"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1002\/net.3230240504"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1002\/net.3230210404"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1002\/net.20300"},{"key":"ref15","first-page":"1","article-title":"On networks with the maximum numbers of trees","author":"leggett","year":"1965","journal-title":"Proc Eighth Midwest Symposium on Circuit Theory"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/S0012-365X(97)00034-4"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"ball","year":"1983","journal-title":"SIAM J Computing"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/RNDM.2016.7608271"},{"year":"1993","author":"biggs","journal-title":"Algebraic Graph Theory Cambridge Math Library","key":"ref19"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/978-1-4615-5087-7_8"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1002\/andp.18471481202"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TCS.1987.1086075"},{"year":"2012","author":"beineke","journal-title":"Topics in Structural Graph Theory ser Encyclopedia of Mathematics and its Applications","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1002\/net.3230210204"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1002\/net.3230150210"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1073\/pnas.48.7.1142"},{"year":"2004","author":"bollob\u00e1s","journal-title":"Extremal Graph Theory ser Dover Books on Mathematics","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/BF01585735"},{"year":"2010","author":"mahjani","article-title":"Exploring connectivity of random subgraphs of a graph","key":"ref20"},{"year":"1993","author":"holton","journal-title":"The Petersen Graph ser Australian Mathematical Society Lecture Series","key":"ref22"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/0095-8956(77)90034-X"},{"key":"ref23","article-title":"The art of computer programming: Introduction to combinatiorial algorithms and Boolean functions","author":"knuth","year":"2008","journal-title":"Addison-Wesley series in Computer Science and Information Proceedings"}],"event":{"name":"2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM)","start":{"date-parts":[[2017,9,4]]},"location":"Alghero","end":{"date-parts":[[2017,9,6]]}},"container-title":["2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8082388\/8093011\/08093016.pdf?arnumber=8093016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T14:24:09Z","timestamp":1570285449000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8093016\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/rndm.2017.8093016","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}