{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:01Z","timestamp":1757629381275,"version":"3.44.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0743-7315(91)90081-j","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"338-344","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Generalized supercube: An incrementally expandable interconnection network"],"prefix":"10.1016","volume":"13","author":[{"given":"Arunabha","family":"Sen","sequence":"first","affiliation":[]},{"given":"Abhijit","family":"Sengupta","sequence":"additional","affiliation":[]},{"given":"Subir","family":"Bandyopadhyay","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90081-J_BIB1","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TC.1983.1676267","article-title":"On the connectivity of some telecommunication network","volume":"C-32","author":"Amar","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB2","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/TC.1981.1675844","article-title":"Fault-diagnosis in Boolean n-cube array of microprocessors","volume":"C-30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(91)90081-J_BIB3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(82)90076-X","article-title":"Tables of large graphs with given degree and diameter","volume":"15","author":"Bermond","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(91)90081-J_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized hypercube and hyperbus structure for a computer network","volume":"C-33","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"year":"1974","series-title":"Graph Theory with Applications to Engineering and Computer Science","author":"Deo","key":"10.1016\/0743-7315(91)90081-J_BIB5"},{"key":"10.1016\/0743-7315(91)90081-J_BIB6","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TC.1985.1676633","article-title":"Fault-tolerant routing in DeBruijn communication network","volume":"C-34","author":"Esfahanian","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB7","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d, k) digraph problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB8","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1985.1676608","article-title":"A regular fault tolerant architecture for interconnection networks","volume":"C-34","author":"Hawkes","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/TC.1981.1675772","article-title":"The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI","volume":"C-30","author":"Horowitz","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on buildingblock network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graph with small diameters","volume":"C-34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TC.1984.1676410","article-title":"Families of fixed degree graphs for processor interconnection","volume":"C-33","author":"Jerrum","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB13","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/12.4611","article-title":"Incomplete hypercube","volume":"C-37","author":"Katseff","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(91)90081-J_BIB14","article-title":"High density graphs for processor interconnection","volume":"12","author":"Leland","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(91)90081-J_BIB15","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TC.1982.1676084","article-title":"Some new results about the (d, k) graph problem","volume":"C-31","author":"Memmi","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90081-J_BIB16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TC.1985.1676513","article-title":"A fault tolerant communication architecture for distributed system","volume":"C-31","author":"Pradhan","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/0743-7315(91)90081-J_BIB17","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"year":"1987","series-title":"Multicomputer Networks","author":"Reed","key":"10.1016\/0743-7315(91)90081-J_BIB18"},{"key":"10.1016\/0743-7315(91)90081-J_BIB19","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\/0743-7315(91)90081-J_BIB20","series-title":"Proc. AFIPS Spring Joint Computer Conference","first-page":"395","article-title":"Programming and design considerations of a highly parallel computer","author":"Squire","year":"1963"},{"key":"10.1016\/0743-7315(91)90081-J_BIB21","series-title":"Proc. Fourth Symposium Comput. Architecture","first-page":"105","article-title":"A large scale homogeneous, fully distributed parallel machine. I","author":"Sullivan","year":"1977"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190081J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190081J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:17Z","timestamp":1757514617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190081J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["074373159190081J"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90081-j","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized supercube: An incrementally expandable interconnection network","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90081-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}