{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:16:48Z","timestamp":1648775808509},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":[[1998,12]]},"DOI":"10.1016\/s0020-0190(98)00179-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"303-305","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical broadcast networks"],"prefix":"10.1016","volume":"68","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00179-3_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230260302","article-title":"Antepenultimate broadcasting","volume":"26","author":"Bermond","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(98)00179-3_BIB2","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":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(98)00179-3_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","article-title":"Tight bounds on minimum broadcast networks","volume":"4","author":"Grigni","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(98)00179-3_BIB4","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":"1986","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(98)00179-3_BIB5","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting and gossiping)","author":"Hromkovi\u0107","year":"1995"},{"key":"10.1016\/S0020-0190(98)00179-3_BIB6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230230416","article-title":"Some minimum gossip graphs","volume":"23","author":"Labahn","year":"1993","journal-title":"Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001793?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001793?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:28:50Z","timestamp":1556058530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0020019098001793"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00179-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}