{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T22:49:29Z","timestamp":1776466169983,"version":"3.51.2"},"reference-count":25,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0166-218x(99)00043-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"205-232","source":"Crossref","is-referenced-by-count":28,"title":["Compound constructions of broadcast networks"],"prefix":"10.1016","volume":"93","author":[{"given":"Michael J.","family":"Dinneen","sequence":"first","affiliation":[]},{"given":"Jose A.","family":"Ventura","sequence":"additional","affiliation":[]},{"given":"Mark C.","family":"Wilson","sequence":"additional","affiliation":[]},{"given":"Golbon","family":"Zakeri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00043-8_BIB1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/152610.152612","article-title":"The consensus problem for fault-tolerant computing","volume":"25","author":"Barborak","year":"1993","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230260302","article-title":"Antepenultimate broadcasting","volume":"26","author":"Bermond","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90226-Z","article-title":"Sparse broadcast graphs","volume":"36","author":"Bermond","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0405002","article-title":"Broadcasting in bounded degree graphs","volume":"5","author":"Bermond","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB5","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\/S0166-218X(99)00043-8_BIB6","first-page":"605","article-title":"An upper bound for the broadcast function B(n)","volume":"13","author":"Chen","year":"1990","journal-title":"Chinese J. Comput."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB7","doi-asserted-by":"crossref","unstructured":"M.J. Dinneen, M.R. Fellows, V. Faber, Algebraic constructions of efficient broadcast networks, in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes 9, Lecture Notes in Computer Science, vol. 539, Springer, Berlin, 1991, pp. 152\u2013158.","DOI":"10.1007\/3-540-54522-0_104"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB8","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\/S0166-218X(99)00043-8_BIB9","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\/S0166-218X(99)00043-8_BIB10","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\/S0166-218X(99)00043-8_BIB11","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1002\/net.3230190606","article-title":"On the construction of minimal broadcast networks","volume":"19","author":"Gargano","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00043-8_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\/S0166-218X(99)00043-8_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":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB14","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d , R. Klasing, B. Monien, R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping), in: Combinatorial Network Theory, Applied Optimization, vol. 1, Kluwer, Dordrecht, 1996, pp. 125\u2013212.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB15","unstructured":"L.H. Khachatrian, H.S. Haroutunian, Construction of new classes of minimal broadcast networks, in: Proceedings 3rd International Colloquium on Coding Theory, Armenia, 1990, pp. 69\u201377."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0166-218X(94)90188-0","article-title":"A minimum broadcast graph on 63 vertices","volume":"53","author":"Labahn","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230230416","article-title":"Some minimum gossip graphs","volume":"23","author":"Labahn","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB18","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(94)90190-2","article-title":"Some minimum broadcast graphs","volume":"53","author":"Maheo","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB19","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\/S0166-218X(99)00043-8_BIB20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","article-title":"Fault-tolerant broadcasting and gossiping in communication networks","volume":"28","author":"Pelc","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB21","unstructured":"Ridwan, Construction of minimal broadcast networks, Master's thesis, Pennsylvania State University, August 1995."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(95)00200-G","article-title":"Lower bounds for the size in four families of minimum broadcast graphs","volume":"150","author":"Sacl\u00e9","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB23","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","article-title":"Information dissemination in trees","volume":"10","author":"Slater","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00043-8_BIB24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/net.3230230505","article-title":"A new method for constructing minimal broadcast networks","volume":"23","author":"Ventura","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00043-8_BIB25","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02110308","article-title":"A doubling procedure for constructing minimal broadcast networks","volume":"3","author":"Weng","year":"1995","journal-title":"Telecomm. Syst."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000438?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000438?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:53Z","timestamp":1556666873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0166218X99000438"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00043-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}