References
J.C. Bermond and C. Peyrat. de Bruijn and Kautz Networks: a competitor for the hypercube? In Hypercubes and Distributed Computers, North-Holland, 1989. Elsevier Science Publishers.
F.T. Leighton, M. Newmann, A.G. Ranade, and E. Schwabe. Dynamic Tree Embeddings in Butterflies and Hypercubes. In Proceedings of the 1989 A CM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, June 1989.
B. Monien and H. Sudborough. Embedding one Interconnection Network in Another. In Computational Graph Theory, Wien, 1990. Springer Verlag.
S. Öhring. The de Bruijn Network: An Efficient Host for Static Embeddings of Various Program Structures. Technical report, TR 1028-91, Universität Würzburg, Lehrstuhl Informatik 1, 1991.
S. Öhring. Dynamic Embeddings of Arbitrary Trees in de Bruijn Graphs. Technical report, TR 0307-92, Universität Würzburg, Lehrstuhl Informatik 1, 1992.
M.R. Samatham and D.K. Pradhan. The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI. In IEEE Transactions on Computers, Vol. 38, No. 4, April 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Öhring, S. (1992). Dynamic tree embeddings into de Bruijn graphs. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_487
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_487
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive