{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:05:33Z","timestamp":1649016333921},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00104-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"61-77","source":"Crossref","is-referenced-by-count":1,"title":["Minimum-time multidrop broadcast"],"prefix":"10.1016","volume":"83","author":[{"given":"Arthur M.","family":"Farley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00104-2_BIB1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(94)90179-1","article-title":"Optimal algorithms for dissemination of information in generalized communication modes","volume":"53","author":"Feldmann","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00104-2_BIB2","article-title":"Evaluation of the MasPar Performances","author":"Gavoille","year":"1992","journal-title":"RT-92-01, ENS Lyon"},{"key":"10.1016\/S0166-218X(97)00104-2_BIB3","doi-asserted-by":"crossref","unstructured":"J. Hromkovic\u0306, R. Klasing, E.A. St\u00f6hr, Gossiping in vertex-disjoint paths mode in interconnection networks, Proc. 19th Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer, Berlin.","DOI":"10.1007\/3-540-57899-4_60"},{"key":"10.1016\/S0166-218X(97)00104-2_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/2.191995","article-title":"A survey of wormhole routing techniques in direct networks","author":"Ni","year":"1993","journal-title":"Computer"},{"issue":"5","key":"10.1016\/S0166-218X(97)00104-2_BIB5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TC.1981.1675796","article-title":"Minimum broadcast trees","volume":"C 30","author":"Proskurowski","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00104-2_BIB6","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","article-title":"Information dissemination in trees","volume":"10","author":"Slater","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:50:09Z","timestamp":1555969809000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001042"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00104-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}