This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S.B. Akers, B. Krishnamurthy (1986), A group-theoretic model for symmetric interconnection networks parallel processing, International Conference Parallel Processing, pp.216–233.
F. Annexstein, M. Baumslag, A.L. Rosenberg (1990), Group action graphs and parallel architectures, Siam. J. Comput. 19, N 3, pp.544–569.
J.-C. Bermond, P. Hell, A.L. Liestman, J.G. Peters (1988), Broadcasting in bounded degree graphs, to app. in SIAM J. Discr. Math.
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.
A. Farley, S. Hedetniemi, S. Mitchell, A. Proskurowski (1979), Minimum broadcast graphs, Discrete Math. 25, pp. 189–193.
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.
A.L. Liestman, J.G. Peters (1988), Broadcast networks of bounded degree, Siam. J. Discr. Math. 1, pp. 531–540.
E.A. Stöhr (1990), Broadcasting in the Butterfly network, IPL, to app.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stöhr, E. (1992). On the broadcast time of the butterfly network. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-55121-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55121-8
Online ISBN: 978-3-540-46735-9
eBook Packages: Springer Book Archive