{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:01:06Z","timestamp":1648854066490},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00071-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:27:49Z","timestamp":1027600069000},"page":"85-89","source":"Crossref","is-referenced-by-count":0,"title":["Optimal broadcasting in the back to back d-ary trees"],"prefix":"10.1016","volume":"59","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00071-3_BIB1","article-title":"R\u00e9seaux d'interconnexion: Structures et communications","author":"Barth","year":"1994"},{"key":"10.1016\/0020-0190(96)00071-3_BIB2","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1971"},{"key":"10.1016\/0020-0190(96)00071-3_BIB3","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":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(96)00071-3_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(96)00071-3_BIB5","article-title":"Periodic gossiping scheme in the back to back d-ary tree","author":"Labahn","year":"1994"},{"key":"10.1016\/0020-0190(96)00071-3_BIB6","article-title":"Combinatorics on Words","volume":"Vol. 17","author":"Lothaire","year":"1983"},{"issue":"6","key":"10.1016\/0020-0190(96)00071-3_BIB7","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/12.90248","article-title":"The Kyklos Multicomputer Network: Interconnection strategies, properties and applications","volume":"40","author":"Menezes","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(96)00071-3_BIB8","series-title":"Communications dans les R\u00e9seaux d'Interconnexion","author":"de Rumeur","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000713?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000713?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:53:27Z","timestamp":1556643207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000713"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00071-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}