{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:20:39Z","timestamp":1649010039565},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"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":[[1994,2]]},"DOI":"10.1016\/0304-3975(92)00094-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"329-342","source":"Crossref","is-referenced-by-count":2,"title":["On the construction of regular minimal broadcast digraphs"],"prefix":"10.1016","volume":"124","author":[{"given":"Jung-Heum","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)00094-8_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1982"},{"key":"10.1016\/0304-3975(92)00094-8_BIB2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","article-title":"Implementation and analysis of binomial queue algorithms","volume":"7","author":"Brown","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)00094-8_BIB3","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\/0304-3975(92)00094-8_BIB4","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0095-8956(73)90007-5","article-title":"A class of vertex-transitive digraphs","volume":"14","author":"Chao","year":"1973","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0304-3975(92)00094-8_BIB5","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\/0304-3975(92)00094-8_BIB6","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\/0304-3975(92)00094-8_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(92)00094-8_BIB8","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\/0304-3975(92)00094-8_BIB9","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\/0304-3975(92)00094-8_BIB10","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(92)00094-8_BIB11","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","article-title":"Broadcast networks of bounded degrees","volume":"1","author":"Liestman","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0304-3975(92)00094-8_BIB12","first-page":"141","article-title":"A census of minimum broadcast graphs","volume":"5","author":"Mitchell","year":"1980","journal-title":"J. Combin. Inform. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:58:39Z","timestamp":1555077519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592000948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0304397592000948"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)00094-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}