{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:46Z","timestamp":1759063726653},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1007\/bf02110308","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T00:41:23Z","timestamp":1126572083000},"page":"259-293","source":"Crossref","is-referenced-by-count":15,"title":["A doubling procedure for constructing minimal broadcast networks"],"prefix":"10.1007","volume":"3","author":[{"given":"Michael X.","family":"Weng","sequence":"first","affiliation":[]},{"given":"Jose A.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02110308_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90226-Z","volume":"36","author":"J.C. Bermond","year":"1992","unstructured":"J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters, Sparse broadcast graphs, Discr. Appl. Math. 36(1992)97\u2013130.","journal-title":"Discr. Appl. Math."},{"key":"BF02110308_CR2","unstructured":"J.C. Bermond, P. Fraigniaud and J.G. Peters, Antepenultimate broadcasting, Working Paper CMPT TR 92-3, School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada."},{"key":"BF02110308_CR3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0405002","volume":"5","author":"J.C. Bermond","year":"1992","unstructured":"J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters, Broadcasting in bounded degree graphs, SIAM J. Discr. Math. 5(1992)10\u201324.","journal-title":"SIAM J. Discr. Math."},{"key":"BF02110308_CR4","first-page":"110","volume":"10","author":"S.C. Chau","year":"1985","unstructured":"S.C. Chau and A.L. Liestman, Constructing minimal broadcast networks, J. Combin. Inform. Syst. Sci. 10(1985)110\u2013122.","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"BF02110308_CR5","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-54522-0_104","volume":"539","author":"M.J. Dinneen","year":"1991","unstructured":"M.J. Dinneen, M.R. Fellows and V. Faber, Algebraic constructions of efficient broadcast networks, in:Applied Algebra, Agebraic Algorithms and Error Correction Codes 9, Lecture Notes in Computer Science 539 (1991)152\u2013158.","journal-title":"Lecture Notes in Computer Science"},{"key":"BF02110308_CR6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","volume":"9","author":"A.M. Farley","year":"1979","unstructured":"A.M. Farley, Minimal broadcast networks, Networks 9(1979)313\u2013332.","journal-title":"Networks"},{"key":"BF02110308_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0139032","volume":"39","author":"A.M. Farley","year":"1980","unstructured":"A.M. Farley, Broadcast time in communication networks, SIAM J. Appl. Math. 39(1980) 385\u2013390.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02110308_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","volume":"25","author":"A.M. Farley","year":"1979","unstructured":"A.M. Farley, S.T. Hedetniemi, A. Proskurowski and S. Mitchell, Minimum broadcast graphs, Discr. Math. 25(1979)189\u2013193.","journal-title":"Discr. Math."},{"key":"BF02110308_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"key":"BF02110308_CR10","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1002\/net.3230190606","volume":"19","author":"L. Gargano","year":"1989","unstructured":"L. Gargano and U. Vaccaro, On the construction of minimal broadcast networks, Networks 19(1989)673\u2013689.","journal-title":"Networks"},{"key":"BF02110308_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","volume":"4","author":"M. Grigni","year":"1991","unstructured":"M. Grigni and D. Peleg, Tight bounds on minimum broadcast networks, SIAM J. Discr. Math. 4(1991)207\u2013222.","journal-title":"SIAM J. Discr. Math."},{"key":"BF02110308_CR12","unstructured":"L.H. Khachatrian and O.S. Harutounian, Construction of new classes of minimal broadcast networks,Conf. on Coding Theory, Arminia (1990)."},{"key":"BF02110308_CR13","doi-asserted-by":"crossref","unstructured":"R. Labahn, A minimum broadcast graph on 63 vertices, Discr. Appl. Math., to appear.","DOI":"10.1016\/0166-218X(94)90188-0"},{"key":"BF02110308_CR14","doi-asserted-by":"crossref","unstructured":"M. Maheo and J.F. Sacle, Some minimum broadcast graphs, Discr. Appl. Math., to appear.","DOI":"10.1016\/0166-218X(94)90190-2"},{"key":"BF02110308_CR15","first-page":"141","volume":"5","author":"S. Mitchell","year":"1980","unstructured":"S. Mitchell and S.T. Hedetniemi, A census of minimum broadcast graphs, J. Combin. Inform. Syst. Sci. 5(1980)141\u2013151.","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"BF02110308_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","volume":"1","author":"A.L. Liestman","year":"1988","unstructured":"A.L. Liestman and J.G. Peters, Broadcast networks of bounded degree, SIAM J. Discr. Math. 1(1988)531\u2013540.","journal-title":"SIAM J. Discr. Math."},{"key":"BF02110308_CR17","doi-asserted-by":"crossref","unstructured":"A.L. Liestman and J.G. Peters, Minimum broadcast digraphs, Discr. Appl. Math., to appear.","DOI":"10.1016\/0166-218X(92)90148-4"},{"key":"BF02110308_CR18","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"P.J. Slater, E. Cockayne and S.T. Hedetniemi, Information dissemination in trees, SIAM J. Comp. 10(1981)692\u2013701.","journal-title":"SIAM J. Comp."},{"key":"BF02110308_CR19","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/net.3230230505","volume":"23","author":"J.A. Ventura","year":"1993","unstructured":"J.A. Ventura and X. Weng, A new method for constructing minimal broadcast networks, Networks 23(1993)481\u2013497.","journal-title":"Networks"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02110308.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02110308\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02110308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T11:19:19Z","timestamp":1557832759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02110308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["BF02110308"],"URL":"https:\/\/doi.org\/10.1007\/bf02110308","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}