{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:12:07Z","timestamp":1777540327884,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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":[[1994,9]]},"DOI":"10.1016\/0166-218x(94)90185-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"199-209","source":"Crossref","is-referenced-by-count":14,"title":["Minimum k-broadcast graphs"],"prefix":"10.1016","volume":"53","author":[{"given":"J.-C.","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"E.","family":"Lazard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90185-6_BIB1","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(94)90185-6_BIB2","first-page":"110","article-title":"Constructing minimal broadcast networks","volume":"10","author":"Chau","year":"1985","journal-title":"J. Combin. Inform. Systems Sci."},{"key":"10.1016\/0166-218X(94)90185-6_BIB3","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(94)90185-6_BIB4","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(94)90185-6_BIB5","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(94)90185-6_BIB6","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":"1986","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)90185-6_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Johnson","year":"1979"},{"key":"10.1016\/0166-218X(94)90185-6_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0166-218X(92)90147-3","article-title":"Broadcasting in DMA-bound bounded degree graphs","volume":"37\/38","author":"Lazard","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90185-6_BIB9","series-title":"Minimum broadcast digraphs","author":"Liestman","year":"1989"},{"key":"10.1016\/0166-218X(94)90185-6_BIB10","first-page":"141","article-title":"A census of minimum broadcast graphs","volume":"5","author":"Mitchell","year":"1980","journal-title":"J. Combin. Inform. Systems Sci."},{"key":"10.1016\/0166-218X(94)90185-6_BIB11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(94)90190-2","article-title":"Some minimum broadcast graphs","volume":"53","author":"Mah\u00e9o","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90185-6_BIB12","unstructured":"X. Wang, Manuscript (1986)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901856?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901856?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:28:25Z","timestamp":1555136905000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0166218X94901856"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90185-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}