{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:18:19Z","timestamp":1778595499177,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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 Sciences"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0020-0255(00)00089-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:53:54Z","timestamp":1027630434000},"page":"107-128","source":"Crossref","is-referenced-by-count":4,"title":["Routing properties of supercubes"],"prefix":"10.1016","volume":"131","author":[{"given":"Jyh-Jian","family":"Sheu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jimmy J.M.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0255(00)00089-X_BIB1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/12.376173","article-title":"Embedding graphs onto the supercube","volume":"44","author":"Auletta","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0020-0255(00)00089-X_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1142\/S0129626493000435","article-title":"Fault tolerant routing in the supercube","volume":"3","author":"Auletta","year":"1993","journal-title":"Parallel Process. Lett."},{"issue":"4","key":"10.1016\/S0020-0255(00)00089-X_BIB3","first-page":"668","article-title":"On container width and length in graphs, groups and networks","volume":"E77-A","author":"Frank Hsu","year":"1994","journal-title":"IEICE Trans. Fundamentals"},{"key":"10.1016\/S0020-0255(00)00089-X_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90036-1","article-title":"On the k-diameter of k-regular k-connected graphs","volume":"133","author":"Frank Hsu","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB5","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/12.4611","article-title":"Incomplete hypercubes","volume":"37","author":"Katseff","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB6","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","article-title":"Fault diameter of interconnection networks","volume":"13","author":"Krishnamoorthy","year":"1987","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB7","series-title":"Introduction to parallel algorithms and architectures: arrays \u00b7 tree \u00b7 hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0255(00)00089-X_BIB8","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercube","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB9","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/BF00289159","article-title":"Supercube: An optimally fault tolerant network architecture","volume":"26","author":"Sen","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(92)90130-N","article-title":"On the routing problem in faulty supercubes","volume":"42","author":"Sen","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0255(00)00089-X_BIB11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/S0129626499000050","article-title":"The fault diameter of supercubes","volume":"9","author":"Sheu","year":"1999","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB12","series-title":"Graph Theory","author":"Tutte","year":"1984"},{"key":"10.1016\/S0020-0255(00)00089-X_BIB13","first-page":"556","article-title":"The shortest routing algorithm for supercube","author":"Yuan","year":"1991","journal-title":"Proc. Nat. Comput. Sympos."},{"key":"10.1016\/S0020-0255(00)00089-X_BIB14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(91)90215-4","article-title":"Topological properties of supercube","volume":"37","author":"Yuan","year":"1991","journal-title":"Inform. Process. Lett."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002550000089X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002550000089X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T00:01:14Z","timestamp":1555804874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002550000089X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S002002550000089X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(00)00089-x","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}