On the broadcast time of the butterfly network

  • Elena Stöhr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 570)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. S.B. Akers, B. Krishnamurthy (1986), A group-theoretic model for symmetric interconnection networks parallel processing, International Conference Parallel Processing, pp.216–233.Google Scholar
  2. F. Annexstein, M. Baumslag, A.L. Rosenberg (1990), Group action graphs and parallel architectures, Siam. J. Comput. 19, N 3, pp.544–569.Google Scholar
  3. J.-C. Bermond, P. Hell, A.L. Liestman, J.G. Peters (1988), Broadcasting in bounded degree graphs, to app. in SIAM J. Discr. Math.Google Scholar
  4. J.-C. Bermond, C. Peyrat (1988), Broadcasting in deBruijn networks, in Proc. Nineteenth SE Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium, pp. 283–292.Google Scholar
  5. A. Farley, S. Hedetniemi, S. Mitchell, A. Proskurowski (1979), Minimum broadcast graphs, Discrete Math. 25, pp. 189–193.Google Scholar
  6. J. Hromkovic, C.D. Jeschke, B. Monien (1990), Optimal algorithms for dissemination of information in some interconnection networks, Proc. MFCS'90, LNCS 452, pp 337–346.Google Scholar
  7. A.L. Liestman, J.G. Peters (1988), Broadcast networks of bounded degree, Siam. J. Discr. Math. 1, pp. 531–540.Google Scholar
  8. E.A. Stöhr (1990), Broadcasting in the Butterfly network, IPL, to app.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Elena Stöhr
    • 1
  1. 1.Karl-Weierstraß-Institut für MathematikBerlinGermany

Personalised recommendations