{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:28:39Z","timestamp":1760131719120},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf01908630","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T11:56:24Z","timestamp":1122033384000},"page":"24-40","source":"Crossref","is-referenced-by-count":11,"title":["Optimal algorithms for dissemination of information in some interconnection networks"],"prefix":"10.1007","volume":"10","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":[{"issue":"4","key":"BF01908630_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(90)90160-Y","volume":"34","author":"A. Bagchi","year":"1990","unstructured":"A. Bagchi, S. L. Hakimi, J. Mitchem, and E. Schmeichel: Parallel algorithms for gossiping by mail.Inform. Process. Lett. 34(4) (1990), 197\u2013202.","journal-title":"Inform. Process. Lett."},{"key":"BF01908630_CR2","first-page":"283","volume-title":"Congressus Numerantium, Vol. 66","author":"J.-C. Bermond","year":"1988","unstructured":"J.-C. Bermond and C. Peyrat: Broadcasting in DeBruijn networks.Proc. 19th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 283\u2013292. Congressus Numerantium, Vol. 66. Utilitas Math., Winnipeg, Manitoba, 1988."},{"key":"BF01908630_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 and R. Shostak: Gossips and telephones.Discrete Math. 2 (1972), 191\u2013193.","journal-title":"Discrete Math."},{"key":"BF01908630_CR4","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien: On the number of rounds necessary to disseminate information.Proc. 1st ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, June 1989, pp. 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"BF01908630_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 and P. J. Slater: Gossips and telegraphs.J. Franklin Instit. 307 (1979), 353\u2013360.","journal-title":"J. Franklin Instit."},{"key":"BF01908630_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0306-4379(80)90008-3","volume":"5","author":"A. M. Farley","year":"1980","unstructured":"A. M. Farley and A. Proskurowski: Gossiping in grid graphs.J. Combin. Inform. System Sci. 5 (1980), 161\u2013172.","journal-title":"J. Combin. Inform. System Sci."},{"key":"BF01908630_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, S. T. Hedetniemi, and A. L. Liestman: A survey of gossiping and broadcasting in communication networks.Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"BF01908630_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, E. C. Milner, and E. Szemeredi: A cure for the telephone disease.Canad. Math. Bull. 15 (1972), 447\u2013450.","journal-title":"Canad. Math. Bull."},{"key":"BF01908630_CR9","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","volume":"1","author":"A. L. Liestman","year":"1988","unstructured":"A. L. Liestman and J. G. Peters: Broadcast networks of bounded degree.SIAM J. Discrete Math. 1 (1988), 531\u2013540.","journal-title":"SIAM J. Discrete Math."},{"key":"BF01908630_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","volume":"18","author":"D. Richards","year":"1988","unstructured":"D. Richards and A. L. Liestman: Generalization of broadcasting and gossiping.Networks 18 (1988), 125\u2013138.","journal-title":"Networks"},{"key":"BF01908630_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(91)90060-U","volume":"39","author":"E. St\u00f6hr","year":"1991","unstructured":"E. St\u00f6hr: Broadcasting in the butterfly network.Inform. Process. Lett. 39 (1991), 41\u201343.","journal-title":"Inform. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01908630.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01908630\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01908630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T12:22:40Z","timestamp":1557490960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01908630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01908630"],"URL":"https:\/\/doi.org\/10.1007\/bf01908630","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}