{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:32:33Z","timestamp":1649107953709},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00277-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:10:32Z","timestamp":1027613432000},"page":"129-141","source":"Crossref","is-referenced-by-count":2,"title":["Efficient line broadcasting in a d-dimensional grid"],"prefix":"10.1016","volume":"113","author":[{"given":"A.","family":"Averbuch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Roditty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Shoham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00277-8_BIB1","unstructured":"A. Averbuch, I. Gaber, Y. Roditty, Minimum time line broadcasting in certain classes of trees, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/(SICI)1096-9128(19990425)11:5<247::AID-CPE421>3.0.CO;2-G","article-title":"On scheduling tasks of multi-join queries in a multiprocessor","volume":"11","author":"Averbuch","year":"1999","journal-title":"Concurrency: Practice Experience"},{"key":"10.1016\/S0166-218X(00)00277-8_BIB3","unstructured":"A. Averbuch, Y. Roditty, B. Shoham, On broadcasting multiple messages in a positive weighted tree, J. Combin. Math. Combin. Comput., in press."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB4","unstructured":"A. Averbuch, Y. Roditty, B. Shoham, Computation of time-relaxed broadcasting messages in communication networks, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","article-title":"Minimum-time line broadcast networks","volume":"10","author":"Farley","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00277-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\/S0166-218X(00)00277-8_BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00097-8","article-title":"Minimum-cost line broadcasting in paths","volume":"75","author":"Fujita","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0166-218X(00)00277-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\/S0166-218X(00)00277-8_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0166-218X(97)00111-X","article-title":"Line broadcasting in cycles","volume":"83","author":"Kane","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0166-218X(97)89163-9","article-title":"On broadcasting multiple messages in a d-dimensional grid","volume":"75","author":"Roditty","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0166-218X(94)90194-5","article-title":"Broadcasting multiple messages in a grid","volume":"53","author":"Van Scoy","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00277-8_BIB13","unstructured":"D. West, Introduction to Graph Theory, Simon & Schuster A Viacom Company, Upper Saddle River, NJ 07458, 1996."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002778?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002778?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T09:53:01Z","timestamp":1556272381000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00002778"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00277-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}