{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:49:10Z","timestamp":1649155750504},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0304-3975(94)90049-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"395-402","source":"Crossref","is-referenced-by-count":3,"title":["Note on optimal gossiping in some weak-connected graphs"],"prefix":"10.1016","volume":"127","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Claus-Dieter","family":"Jeschke","sequence":"additional","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90049-3_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(90)90160-Y","article-title":"Parallel algorithms for gossiping by mail","volume":"34","author":"Bagchi","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90049-3_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(72)90001-5","article-title":"Gossips and telephones","volume":"2","author":"Baker","year":"1972","journal-title":"Discr. Math."},{"key":"10.1016\/0304-3975(94)90049-3_BIB3","series-title":"Proc. 19th Southeastern Conference on Combinatorics, Graph Theory and Computing","first-page":"283","article-title":"Broadcasting in DeBruijn networks","author":"Bermond","year":"1988"},{"key":"10.1016\/0304-3975(94)90049-3_BIB4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","article-title":"Gossiping in minimal time","volume":"21","author":"Cybenko","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90049-3_BIB5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","article-title":"Gossips and telegraphs","volume":"307","author":"Entringer","year":"1979","journal-title":"J. Franklin Institute"},{"key":"10.1016\/0304-3975(94)90049-3_BIB6","first-page":"318","article-title":"On the number of rounds necessary to disseminate information","author":"Even","year":"1989","journal-title":"Proc. 1st ACM Symp. on Parallel Algorithms and Architectures"},{"key":"10.1016\/0304-3975(94)90049-3_BIB7","first-page":"161","article-title":"Gossiping in grid graphs","volume":"5","author":"Farley","year":"1980","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0304-3975(94)90049-3_BIB8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.4153\/CMB-1972-081-0","article-title":"A cure for the telephone disease","volume":"15","author":"Hajnal","year":"1972","journal-title":"Can. Math. Bull."},{"key":"10.1016\/0304-3975(94)90049-3_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\/0304-3975(94)90049-3_BIB10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01908630","article-title":"Optimal algorithms for dissemination of information in some interconnection networks","volume":"10","author":"Hromkovi\u010d","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)90049-3_BIB11","series-title":"Proc. STACS'92","first-page":"351","article-title":"Broadcasting in Butterfly and De Bruin networks","volume":"Vol. 577","author":"Klasing","year":"1992"},{"key":"10.1016\/0304-3975(94)90049-3_BIB12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","article-title":"New gossips and telephones","volume":"13","author":"Kn\u00f6del","year":"1975","journal-title":"Discr. Math."},{"key":"10.1016\/0304-3975(94)90049-3_BIB13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/0221026","article-title":"Fast gossiping for the hypercube","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90049-3_BIB14","series-title":"Topics in Combinatorics and Graph Theory","first-page":"451","article-title":"Quick gossiping by multi-telegraphs","author":"Labahn","year":"1990"},{"key":"10.1016\/0304-3975(94)90049-3_BIB15","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","article-title":"Broadcast networks of bounded degree","volume":"1","author":"Liestman","year":"1988","journal-title":"SIAM J. Discr. Math."},{"key":"10.1016\/0304-3975(94)90049-3_BIB16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","article-title":"Generalization of broadcasting and gossiping","volume":"18","author":"Richards","year":"1988","journal-title":"Network"},{"key":"10.1016\/0304-3975(94)90049-3_BIB17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(91)90060-U","article-title":"Broadcasting in the butterfly network","volume":"39","author":"St\u00f6hr","year":"1991","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:27:13Z","timestamp":1555115233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0304397594900493"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90049-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}