{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:40:13Z","timestamp":1768884013914,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0012-365x(79)90022-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"189-193","source":"Crossref","is-referenced-by-count":98,"title":["Minimum broadcast graphs"],"prefix":"10.1016","volume":"25","author":[{"given":"Arthur","family":"Farley","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"Sandra","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90022-0_BIB1","unstructured":"E. Cockayne and S. Hedetniemi, A conjecture concerning broadcasting in m-dimensional grid graphs, CS-TR-78-14, Computer Science Department, University of Oregon."},{"key":"10.1016\/0012-365X(79)90022-0_BIB2","doi-asserted-by":"crossref","unstructured":"A. Farley, Minimal broadcast networks, Networks, to appear.","DOI":"10.1002\/net.3230090404"},{"key":"10.1016\/0012-365X(79)90022-0_BIB3","series-title":"Proceedings of the Ninth Southeastern Conference on Combinatorics and Graph Theory","article-title":"Broadcasting in grid graphs","author":"Farley","year":"1978"},{"key":"10.1016\/0012-365X(79)90022-0_BIB4","unstructured":"A. Farley, S. Hedetniemi, S. Mitchell and A. Proskurowski, Minimum broadcast graphs, CS-TR- 77-2, Computer Science Department, University of Oregon."},{"key":"10.1016\/0012-365X(79)90022-0_BIB5","unstructured":"S.T. Hedetniemi and S. Mitchell, A census of minimum broadcast graphs, CS-TR-78-7, Computer Science Department, University of Oregon, submitted."},{"key":"10.1016\/0012-365X(79)90022-0_BIB6","unstructured":"A. Proskurowski, Minimum broadcast trees, CS-TR-78-18, Computer Science Department, University of Oregon."},{"key":"10.1016\/0012-365X(79)90022-0_BIB7","unstructured":"P. Slater, E. Cockayne and S. Hedetniemi, Information dissemination in trees, CS-TR-78-11, Computer Science Department, University of Oregon, submitted."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79900220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79900220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:22:05Z","timestamp":1555154525000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79900220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0012365X79900220"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90022-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}