{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:17:11Z","timestamp":1712301431318},"reference-count":13,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0020-0190(00)00014-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:53:01Z","timestamp":1027623181000},"page":"131-136","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical broadcast and gossip networks"],"prefix":"10.1016","volume":"73","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00014-4_ID003","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","article-title":"Gossips and telegraphs","volume":"Vol. 307","author":"Entringer","year":"1979","journal-title":"J. Franklin Institute"},{"key":"10.1016\/S0020-0190(00)00014-4_ID004","series-title":"Proc. 1st ACM Symp. on Parallel Algorithms and Architectures","first-page":"318","article-title":"On the number of rounds necessary to disseminate information","author":"Even","year":"1989"},{"key":"10.1016\/S0020-0190(00)00014-4_ID005","doi-asserted-by":"crossref","unstructured":"G. Fertin, A study of minimum gossip graphs, Discrete Math., to appear","DOI":"10.1016\/S0012-365X(99)00227-7"},{"key":"10.1016\/S0020-0190(00)00014-4_ID006","series-title":"Proc. 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO '99)","first-page":"137","article-title":"Trade-offs for odd gossiping","volume":"Vol. 5","author":"Fertin","year":"1999"},{"key":"10.1016\/S0020-0190(00)00014-4_ID007","series-title":"Proc. Workshop on Communication\u201423rd Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Brno, Czech Republic","article-title":"Odd gossiping in the linear cost model","author":"Fertin","year":"1998"},{"key":"10.1016\/S0020-0190(00)00014-4_ID008","series-title":"Optimal odd gossiping","author":"Fertin","year":"1998"},{"key":"10.1016\/S0020-0190(00)00014-4_ID009","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0020-0190(98)00179-3","article-title":"Hierarchical broadcast networks","volume":"Vol. 68","author":"Fraigniaud","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00014-4_ID010","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"Vol. 53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(00)00014-4_ID011","series-title":"Minimum linear gossip graphs and maximal linear (\u0394,k)-gossip graphs","author":"Fraigniaud","year":"1994"},{"key":"10.1016\/S0020-0190(00)00014-4_ID012","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"Vol. 18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(00)00014-4_ID013","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting and gossiping)","author":"Hromkovi\u010d","year":"1995"},{"key":"10.1016\/S0020-0190(00)00014-4_ID014","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","article-title":"New gossips and telephones","volume":"Vol. 13","author":"Kn\u00f6del","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(00)00014-4_ID015","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0166-218X(92)90148-4","article-title":"Minimum broadcast digraphs","volume":"Vol. 37\/38","author":"Liestman","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000144?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000144?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T08:24:55Z","timestamp":1556007895000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":13,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0020019000000144"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00014-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}