{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:57Z","timestamp":1759063677740},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7686,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90147-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"387-400","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Broadcasting in DMA-bound bounded degree graphs"],"prefix":"10.1016","volume":"37-38","author":[{"given":"E.","family":"Lazard","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90147-3_BIB1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: Some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0166-218X(92)90147-3_BIB2","series-title":"Tech. Rep. 88-5","article-title":"Broadcasting in bounded degree graphs","author":"Bermond","year":"1988"},{"key":"10.1016\/0166-218X(92)90147-3_BIB3","unstructured":"J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters, New minimum broadcast graphs and sparse broadcast graphs, Discrete Appl. Math., to appear."},{"key":"10.1016\/0166-218X(92)90147-3_BIB4","first-page":"283","article-title":"Broadcasting in de Bruijin networks","volume":"66","author":"Bermond","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)90147-3_BIB5","series-title":"Graph Theory With Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(92)90147-3_BIB6","first-page":"19","article-title":"Time bounds for broadcasting in bounded degree graphs","author":"Capocelli","year":"1989","journal-title":"WG 89 15th International Workshop on Graphtheoretic Concepts in Computer Science"},{"key":"10.1016\/0166-218X(92)90147-3_BIB7","first-page":"110","article-title":"Constructing minimal broadcast networks","volume":"10","author":"Chau","year":"1985","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0166-218X(92)90147-3_BIB8","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijin","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A"},{"key":"10.1016\/0166-218X(92)90147-3_BIB9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","article-title":"Minimal broadcast networks","volume":"9","author":"Farley","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90147-3_BIB10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","article-title":"Minimum broadcast graphs","volume":"25","author":"Farley","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90147-3_BIB11","series-title":"Tech. Rept.","article-title":"Complexity analysis of brodcasting in hypercubes with restricted communication capabilities","author":"Fraigniaud","year":"1989"},{"key":"10.1016\/0166-218X(92)90147-3_BIB12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","article-title":"Tight bounds on minimum broadcast networks","volume":"4","author":"Grigni","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(92)90147-3_BIB13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetneimi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90147-3_BIB14","series-title":"LRI Tech. Rept. 526","article-title":"Broadcasting and spanning trees in de Bruijin and Kautz networks","author":"Heydemann","year":"1989"},{"key":"10.1016\/0166-218X(92)90147-3_BIB15","series-title":"ACM Distinguished Dissertations","article-title":"The Connection Machine","author":"Hillis","year":"1985"},{"key":"10.1016\/0166-218X(92)90147-3_BIB16","first-page":"640","article-title":"Distributed routing algorithms for broadcasting and personalized communications in hypercubes","author":"Ho","year":"1986","journal-title":"Proceedings 1986 International Conference on Parallel Processing"},{"key":"10.1016\/0166-218X(92)90147-3_BIB17","series-title":"Graph Theory With Applications","author":"Johnson","year":"1979"},{"key":"10.1016\/0166-218X(92)90147-3_BIB18","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90147-3_BIB19","series-title":"LRI Tech. Rept. 536","article-title":"Broadcasting in DMA-bound bounded degree graphs","author":"Lazard","year":"1990"},{"key":"10.1016\/0166-218X(92)90147-3_BIB20","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","article-title":"Broadcast networks of bounded degree","volume":"1","author":"Liestman","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(92)90147-3_BIB21","series-title":"Tech. Rept. 89-3","article-title":"Minimum broadcast digraphs","author":"Liestman","year":"1989"},{"key":"10.1016\/0166-218X(92)90147-3_BIB22","doi-asserted-by":"crossref","first-page":"745","DOI":"10.2307\/2308649","article-title":"Generalized Fibonacci numbers and matrices","volume":"67","author":"Miles","year":"1960","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0166-218X(92)90147-3_BIB23","first-page":"141","article-title":"A census of minimum broadcast graphs","volume":"5","author":"Mitchell","year":"1980","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0166-218X(92)90147-3_BIB24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0743-7315(89)90045-2","article-title":"Data communication in hypercubes","volume":"6","author":"Saad","year":"1989","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0166-218X(92)90147-3_BIB25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0743-7315(90)90026-L","article-title":"Intensive hypercube communication I: Prearranged communication in link-bound machines","volume":"10","author":"Stout","year":"1990","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0166-218X(92)90147-3_BIB26","author":"Wang","year":"1986","journal-title":"Manuscript"},{"key":"10.1016\/0166-218X(92)90147-3_BIB27","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(94)90180-5"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901473?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901473?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:25Z","timestamp":1555136605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92901473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":27,"alternative-id":["0166218X92901473"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90147-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}