{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:29Z","timestamp":1725456749367},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029627","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"337-346","source":"Crossref","is-referenced-by-count":8,"title":["Optimal algorithms for dissemination of information in some interconnection networks"],"prefix":"10.1007","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":"297","reference":[{"key":"36_CR1","unstructured":"A. Bagchi \u2014 S.L. Hakimi \u2014 J. Mitchem \u2014 E. Schmeichel: Parallel algorithms for gossiping by mail. Unpublished manuscript."},{"key":"36_CR2","first-page":"283","volume":"66","author":"J.-C. Bermond","year":"1988","unstructured":"J.-C. Bermond \u2014 C. Peyrat: Broadcasting in DeBruijn networks. In: Proc. 19th Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium 66 (1988), 283\u2013292.","journal-title":"Congressus Numerantium"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(72)90001-5","volume":"2","author":"B. Baker","year":"1972","unstructured":"B. Baker \u2014 R. Shostak: Gossips and Telephones. Discr. Mathem. 2 (1972), 191\u2013193.","journal-title":"Discr. Mathem."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"S. Even \u2014 B. Monien: On the number of rounds necessary to disseminate information. Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, June 1989.","DOI":"10.1145\/72935.72969"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","volume":"307","author":"R.C. Entringer","year":"1979","unstructured":"R.C. Entringer \u2014 P.J. Slater: Gossips and telegraphs. J. Franklin Institute 307 (1979), 353\u2013360.","journal-title":"J. Franklin Institute"},{"key":"36_CR6","first-page":"161","volume":"5","author":"A.M. Farley","year":"1980","unstructured":"A.M. Farley \u2014 A. Proskurowski: Gossiping in grid graphs. J. Combin. Inform. System Sci. 5 (1980), 161\u2013172.","journal-title":"J. Combin. Inform. System Sci."},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"S.M. Hedetniemi \u2014 S.T. Hedetniemi \u2014 A.L. Liestman: A survey of gossiping and broadcasting in communication networks. Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.4153\/CMB-1972-081-0","volume":"15","author":"A. Hajnal","year":"1972","unstructured":"A. Hajnal \u2014 E.C. Milner \u2014 E. Szemeredi: A cure for the telephone disease. Can. Math. Bull. 15 (1972), 447\u2013450.","journal-title":"Can. Math. Bull."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W. Kn\u00f6del","year":"1975","unstructured":"W. Kn\u00f6del: New gossips and telephones. Discrete Math. 13 (1975), 95.","journal-title":"Discrete Math."},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","volume":"1","author":"A.L. Liestman","year":"1988","unstructured":"A.L. Liestman \u2014 J.G. Peters: Broadcast networks of bounded degree. SIAM J. Disc. Math. 1 (1988), 531\u2013540.","journal-title":"SIAM J. Disc. Math."},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","volume":"18","author":"D. Richards","year":"1988","unstructured":"D. Richards \u2014 A.L. Liestman: Generalization of broadcasting and gossiping. Network 18 (1988), 125\u2013138.","journal-title":"Network"},{"key":"36_CR12","unstructured":"E. St\u00f6hr: Broadcasting in the butterfly graph, manuscript 1989."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:12Z","timestamp":1586592912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0029627","relation":{},"subject":[]}}