{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:45:26Z","timestamp":1648860326954},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"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":[[1995,5]]},"DOI":"10.1016\/0020-0190(95)00029-c","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:50:09Z","timestamp":1027590609000},"page":"223-227","source":"Crossref","is-referenced-by-count":2,"title":["A note on the size of a multicast tree in hypercubes"],"prefix":"10.1016","volume":"54","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00029-C_BIB1","article-title":"The complexity of optimal distance-preserving graphs","author":"Choi","year":"1989"},{"key":"10.1016\/0020-0190(95)00029-C_BIB2","series-title":"Proc. 14th Internat. Conf. on Distributed Computer Systems","first-page":"632","article-title":"Fault-tolerant multi-destination routing in hypercube multiprocessor","author":"Lan","year":"1992"},{"key":"10.1016\/0020-0190(95)00029-C_BIB3","first-page":"58","article-title":"Multicast in faulty hypercubes","volume":"Vol. I","author":"Lan","year":"1992"},{"key":"10.1016\/0020-0190(95)00029-C_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0743-7315(90)90066-X","article-title":"Multicast in hypercube multiprocessors","volume":"8","author":"Lan","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"issue":"10","key":"10.1016\/0020-0190(95)00029-C_BIB5","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/71.246072","article-title":"Multicast communication in multicomputer networks","volume":"4","author":"Lin","year":"1993","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/0020-0190(95)00029-C_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/FMPC.1990.89485","article-title":"A fast O(k) multicast message routing algorithm","author":"Sager","year":"1990"},{"key":"10.1016\/0020-0190(95)00029-C_BIB7","article-title":"Multicast routing in unreliable networks","author":"Schollmeyer","year":"1991"},{"key":"10.1016\/0020-0190(95)00029-C_BIB8","first-page":"18","article-title":"A multicast algorithm for hypercube multiprocessors","volume":"Vol. III","author":"Sheu","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500029C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500029C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:55:50Z","timestamp":1556488550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500029C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["002001909500029C"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00029-c","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}