Skip to main content
SpringerLink
Log in

Optimal algorithms for dissemination of information in some interconnection networks

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 452))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bagchi — S.L. Hakimi — J. Mitchem — E. Schmeichel: Parallel algorithms for gossiping by mail. Unpublished manuscript.

    Google Scholar 

  2. J.-C. Bermond — C. Peyrat: Broadcasting in DeBruijn networks. In: Proc. 19th Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium 66 (1988), 283–292.

    Google Scholar 

  3. B. Baker — R. Shostak: Gossips and Telephones. Discr. Mathem. 2 (1972), 191–193.

    Google Scholar 

  4. S. Even — B. Monien: On the number of rounds necessary to disseminate information. Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, June 1989.

    Google Scholar 

  5. R.C. Entringer — P.J. Slater: Gossips and telegraphs. J. Franklin Institute 307 (1979), 353–360.

    Google Scholar 

  6. A.M. Farley — A. Proskurowski: Gossiping in grid graphs. J. Combin. Inform. System Sci. 5 (1980), 161–172.

    Google Scholar 

  7. S.M. Hedetniemi — S.T. Hedetniemi — A.L. Liestman: A survey of gossiping and broadcasting in communication networks. Networks 18 (1988), 319–349.

    Google Scholar 

  8. A. Hajnal — E.C. Milner — E. Szemeredi: A cure for the telephone disease. Can. Math. Bull. 15 (1972), 447–450.

    Google Scholar 

  9. W. Knödel: New gossips and telephones. Discrete Math. 13 (1975), 95.

    Google Scholar 

  10. A.L. Liestman — J.G. Peters: Broadcast networks of bounded degree. SIAM J. Disc. Math. 1 (1988), 531–540.

    Google Scholar 

  11. D. Richards — A.L. Liestman: Generalization of broadcasting and gossiping. Network 18 (1988), 125–138.

    Google Scholar 

  12. E. Stöhr: Broadcasting in the butterfly graph, manuscript 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität-GH Paderborn Fachbereich Mathematik-Informatik, 4790, Paderborn

    Juraj Hromkovič, Claus-Dieter Jeschke & Burkhard Monien

Authors
  1. Juraj Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claus-Dieter Jeschke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hromkovič, J., Jeschke, CD., Monien, B. (1990). Optimal algorithms for dissemination of information in some interconnection networks. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029627

Download citation

  • DOI: https://doi.org/10.1007/BFb0029627

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation