{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:08:15Z","timestamp":1744434495145,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/drcn.2003.1275365","type":"proceedings-article","created":{"date-parts":[[2004,7,8]],"date-time":"2004-07-08T20:06:22Z","timestamp":1089317182000},"page":"263-271","source":"Crossref","is-referenced-by-count":2,"title":["A reliable architecture for networks under stress"],"prefix":"10.1109","author":[{"given":"G.E.","family":"Weichenberg","sequence":"first","affiliation":[]},{"given":"V.W.S.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"M.","family":"Medard","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1985.1085667"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/00207168408803440"},{"article-title":"Graphs, Networks, and Algorithms","year":"1981","author":"swamy","key":"ref12"},{"key":"ref13","first-page":"1954","article-title":"Number of trees in a graph","volume":"46","author":"weinberg","year":"1958","journal-title":"Proceedings of the IRE"},{"article-title":"Switched, Fast, and Gigabit Ethernet","year":"1998","author":"breyer","key":"ref14"},{"article-title":"Optical Networks: A Practical Perspective","year":"1998","author":"ramaswami","key":"ref15"},{"article-title":"High-reliability architectures for networks under stress","year":"2003","author":"weichenberg","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210204"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","article-title":"The maximum connectivity of a graph","volume":"48","year":"1962","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220206"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240504"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0607011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335424"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","article-title":"Graph Theory","author":"harary","year":"1969"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5087-7_8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01433466"}],"event":{"name":"Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003).","location":"Banff, Alberta, Canada"},"container-title":["Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8992\/28534\/01275365.pdf?arnumber=1275365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T18:02:29Z","timestamp":1528740149000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1275365\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/drcn.2003.1275365","relation":{},"subject":[]}}