{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:04:58Z","timestamp":1648951498882},"reference-count":16,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/s0167-8191(96)00630-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:15:57Z","timestamp":1027588557000},"page":"1239-1254","source":"Crossref","is-referenced-by-count":4,"title":["New algorithm for constructing fault-tolerant solutions of the circulant graph configuration"],"prefix":"10.1016","volume":"22","author":[{"given":"Abdel Aziz","family":"Farrag","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-8191(96)00630-8_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/71.80194","article-title":"An efficient modular allocation scheme and its applications to fault tolerant binary hypercubes","volume":"2","author":"Alam","year":"1991","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00630-8_BIB2","author":"Anderson","year":"1981"},{"key":"10.1016\/S0167-8191(96)00630-8_BIB3","series-title":"Proc. 1st European Dependable Computing Conf.","article-title":"Reconfiguration of faulty hypercubes","author":"Aversky","year":"1994"},{"issue":"9","key":"10.1016\/S0167-8191(96)00630-8_BIB4","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/12.241598","article-title":"Fault-tolerant meshes and hypercubes with minimal number of spares","volume":"42","author":"Bruck","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(96)00630-8_BIB5","series-title":"Proc. IEEE 13th Conf. on Fault Tolerant Computing Symp.","first-page":"26","article-title":"Diogenes: A methodology for designing fault-tolerant VLSI processor arrays","author":"Chung","year":"1983"},{"key":"10.1016\/S0167-8191(96)00630-8_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0743-7315(91)90129-W","article-title":"Designing fault-tolerant systems using automorphisms","author":"Dutt","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"issue":"9","key":"10.1016\/S0167-8191(96)00630-8_BIB7","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1016\/0167-8191(94)90038-8","article-title":"Tolerating faulty edges in a multi-dimensional mesh","volume":"20","author":"Farrag","year":"1994","journal-title":"Parallel Computing"},{"issue":"6","key":"10.1016\/S0167-8191(96)00630-8_BIB8","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1002\/net.3230190608","article-title":"Designing optimal fault-tolerant star networks","volume":"19","author":"Farrag","year":"1989","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0167-8191(96)00630-8_BIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/71.265947","article-title":"The fault-tolerant extension problem for complete multipartite networks","volume":"5","author":"Farrag","year":"1994","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00630-8_BIB10","doi-asserted-by":"crossref","unstructured":"F. Harary and J. Hayes, Edge fault tolerance of graphs, Networks, to appear.","DOI":"10.1002\/net.3230230207"},{"issue":"9","key":"10.1016\/S0167-8191(96)00630-8_BIB11","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TC.1976.1674712","article-title":"A graph model for fault-tolerant computing systems","volume":"25","author":"Hayes","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(96)00630-8_BIB12","author":"Lipson","year":"1981"},{"key":"10.1016\/S0167-8191(96)00630-8_BIB13","series-title":"Digest of Papers of IEEE Symp. on Fault-Tolerant Computing","first-page":"344","article-title":"On implementing fault-tolerance in binary hypercubes","author":"Rennels","year":"1986"},{"issue":"1","key":"10.1016\/S0167-8191(96)00630-8_BIB14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/MM.1984.291309","article-title":"The basic fault-tolerant system","volume":"4","author":"Schmitter","year":"1984","journal-title":"IEEE Micro"},{"issue":"1","key":"10.1016\/S0167-8191(96)00630-8_BIB15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.1982.1653826","article-title":"Introduction to the configurable, highly parallel computer","volume":"15","author":"Snyder","year":"1982","journal-title":"IEEE Comput."},{"key":"10.1016\/S0167-8191(96)00630-8_BIB16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/40.296168","article-title":"Modular fault-tolerant boolean n-cubes","author":"Yang","year":"1994","journal-title":"IEEE Micro"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196006308?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196006308?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T14:28:44Z","timestamp":1556548124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196006308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":16,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0167819196006308"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00630-8","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}