{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T06:26:06Z","timestamp":1673245566271},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0020-0190(02)00225-9","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T22:34:31Z","timestamp":1031610871000},"page":"87-92","source":"Crossref","is-referenced-by-count":6,"title":["Optimal 1-edge fault-tolerant designs for ladders"],"prefix":"10.1016","volume":"84","author":[{"given":"Yen-Chu","family":"Chuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Haw","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00225-9_BIB001","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/12.367998","article-title":"Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes","volume":"44","author":"Bruck","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB002","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1006\/jpdc.1995.1032","article-title":"On the construction of fault-tolerant cube-connected cycles networks","volume":"25","author":"Bruck","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB003","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1142\/S0129626494000351","article-title":"1-edge fault-tolerant design for meshes","volume":"4","author":"Chou","year":"1994","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB004","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1016\/0167-8191(94)90038-8","article-title":"Tolerating faulty edges in a multidimensional mesh","volume":"20","author":"Farrag","year":"1994","journal-title":"Parallel Comput."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB005","series-title":"Topological Graph Theory","author":"Gross","year":"1987"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB006","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.3230230207","article-title":"Edge fault tolerance in graphs","volume":"23","author":"Harary","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB007","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/12.256455","article-title":"An observation on the bisectional interconnection networks","volume":"41","author":"Ho","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB008","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<203::AID-NET5>3.0.CO;2-M","article-title":"Optimally edge fault-tolerant trees","volume":"27","author":"Ku","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB009","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB010","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jgt.3190100111","article-title":"Minimum k-hamiltonian graphs II","volume":"10","author":"Palio","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB011","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1109\/71.298202","article-title":"Adding multiple-fault tolerance to generalized cube networks","volume":"5","author":"Shih","year":"1994","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB012","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/71.577263","article-title":"Multiple-edge-fault tolerance with respect to hypercubes","volume":"8","author":"Sung","year":"1997","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB013","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0406044","article-title":"On minimum fault-tolerant networks","volume":"6","author":"Ueno","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB014","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0020-0190(97)00003-3","article-title":"Faithful 1-edge fault tolerant graphs","volume":"61","author":"Wang","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00225-9_BIB015","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190080118","article-title":"Minimum k-hamiltonian graphs","volume":"8","author":"Wong","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB016","first-page":"1147","article-title":"Fault-tolerant graphs for hypercubes and tori","author":"Yamada","year":"1996","journal-title":"IEICE Trans. Inform. Systems E79-D"},{"key":"10.1016\/S0020-0190(02)00225-9_BIB017","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<181::AID-NET2>3.0.CO;2-G","article-title":"Fault-tolerant graphs for tori","volume":"32","author":"Yamada","year":"1998","journal-title":"Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T07:28:45Z","timestamp":1556782125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0020019002002259"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00225-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}