{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T11:51:27Z","timestamp":1722167487853},"reference-count":20,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":[[2001,8]]},"DOI":"10.1016\/s0167-8191(01)00088-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:12:52Z","timestamp":1027635172000},"page":"1273-1278","source":"Crossref","is-referenced-by-count":4,"title":["A general broadcasting scheme for recursive networks with complete connection"],"prefix":"10.1016","volume":"27","author":[{"given":"Gen-Huey","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shien-Ching","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui-Ling","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yang","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dyi-Rong","family":"Duh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(01)00088-6_BIB1","unstructured":"S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393\u2013400"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB2","volume":"37&38","year":"1992","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0167-8191(01)00088-6_BIB3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<56::AID-NET5>3.0.CO;2-D","article-title":"Hypercomplete: a pancyclic recursive topology for large-scale distributed multicomputer systems","volume":"35","author":"Chen","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB4","doi-asserted-by":"crossref","unstructured":"G.H. Chen, S.C. Hwang, H.L. Huang, M.Y. Su, D.R. Duh, A general broadcasting scheme on recursive networks and its applications, Technical Report NTUCSIE 01-01, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, 2001","DOI":"10.1016\/S0167-8191(01)00088-6"},{"issue":"5","key":"10.1016\/S0167-8191(01)00088-6_BIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","article-title":"Arrangement graphs: a class of generalized star graphs","volume":"42","author":"Day","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB6","doi-asserted-by":"crossref","unstructured":"D.R. Duh, On the study of WK-recursive networks, Ph.D. dissertation, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, May 1994","DOI":"10.1006\/jpdc.1994.1158"},{"issue":"3","key":"10.1016\/S0167-8191(01)00088-6_BIB7","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0743-7315(91)90046-C","article-title":"Embedding mesh of trees in the hypercube","volume":"11","author":"Efe","year":"1991","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB9","series-title":"The Connection Machine","author":"Hillis","year":"1985"},{"issue":"4","key":"10.1016\/S0167-8191(01)00088-6_BIB10","volume":"23","year":"1993","journal-title":"Networks"},{"issue":"1","key":"10.1016\/S0167-8191(01)00088-6_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/71.205649","article-title":"Fibonacci cubes: a new interconnection topology","volume":"4","author":"Hsu","year":"1993","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"12","key":"10.1016\/S0167-8191(01)00088-6_BIB12","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1109\/TC.1987.5009497","article-title":"Hypernet: a communication-efficient architecture for constructing massively parallel computers","volume":"C-36","author":"Hwang","year":"1987","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"10.1016\/S0167-8191(01)00088-6_BIB13","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"C-38","author":"Johnsson","year":"1989","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jpdc.1995.1010","article-title":"Embedding k-ary complete trees into hypercubes","volume":"24","author":"Shen","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(93)90086-O","article-title":"A broadcasting algorithm in star graph interconnection networks","volume":"48","author":"Sheu","year":"1993","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/S0167-8191(01)00088-6_BIB16","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/12.589231","article-title":"Toward optimal broadcasting in a star graph using multiple spanning trees","volume":"46","author":"Tseng","year":"1997","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10.1016\/S0167-8191(01)00088-6_BIB17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-739X(88)90007-6","article-title":"A recursively scalable network VLSI implementation","volume":"4","author":"Vecchia","year":"1988","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"10.1016\/S0167-8191(01)00088-6_BIB18","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0167-739X(90)90034-B","article-title":"An optimized broadcasting technique for WK-recursive topologies","volume":"5","author":"Vecchia","year":"1989","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/S0167-8191(01)00088-6_BIB19","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","article-title":"Embedding of tree networks into hypercubes","volume":"2","author":"Wu","year":"1985","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"7","key":"10.1016\/S0167-8191(01)00088-6_BIB20","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Transactions on Computers"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101000886?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101000886?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T12:26:28Z","timestamp":1555676788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819101000886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0167819101000886"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(01)00088-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}