{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:09:35Z","timestamp":1649153375997},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"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":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0304-3975(99)00282-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:08:42Z","timestamp":1027591722000},"page":"203-216","source":"Crossref","is-referenced-by-count":2,"title":["On the structure of minimum broadcast digraphs"],"prefix":"10.1016","volume":"245","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00282-0_BIB1","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\/S0304-3975(99)00282-0_BIB2","unstructured":"G. Fetin, A study of minimum gossip graphs, Technical Report RR-1172-97, Laboratoire Bordelais de Recherche en Informatique, 1997, submitted for publication."},{"key":"10.1016\/S0304-3975(99)00282-0_BIB3","unstructured":"P. Fraigniaud, J.G. Peters, Minimum linear gossip graphs and maximal linear (\u0394, k)-gossip graphs, Technical Report CMPT TR 94-06, Simon Fraser University, Burnaby, B.C., 1994."},{"key":"10.1016\/S0304-3975(99)00282-0_BIB4","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\/S0304-3975(99)00282-0_BIB5","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\/S0304-3975(99)00282-0_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","article-title":"New gossips and telephones","volume":"13","author":"Kn\u00f6del","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00282-0_BIB7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0166-218X(92)90148-4","article-title":"Minimum broadcast digraphs","volume":"37\/38","author":"Liestman","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00282-0_BIB8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(92)00094-8","article-title":"On the construction of regular minimal broadcast digraphs","volume":"124","author":"Park","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00282-0_BIB9","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002820?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002820?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:54:19Z","timestamp":1556456059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0304397599002820"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00282-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}