Embedding complete binary trees into star and pancake graphs

Theory of Computing Systems

Volumn 31, Issue 3, 1998, Pages 279-305

  Bouabdallah, A ^a,b   Heydemann, M C ^a   Opatrny, J ^c   Sotteau, D ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

^c Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BINS; GRAPH THEORY; GRAPHIC METHODS;

ASYMPTOTICALLY OPTIMAL; COMPLETE BINARY TREE; EMBEDDINGS; INJECTIVE MAPPING; MAXIMUM DISTANCE; PANCAKE GRAPHS; STAR GRAPHS; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 0032368781     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000089     Document Type: Article

References (10)

1. S. Akers, D. Harel, and B. Krishnamurthy. The star graph: an attractive alternative to the n-cube. Proceedings of the International Conference on Parallel Processing, pages 393-400, 1987.
2. S. Bettayeb, B. Cong, M. Girou, and I. Sudborough. Simulating permutation networks on hypercubes. Proceedings of the 1st Latin American Symposium on Theoretical Informatics, pages 61-70. Lecture Notes in Computer Science, volume 583, Springer-Verlag, Berlin, 1992.
3. N. Biggs. Algebraic Graph Theory. Cambridge University Press, Cambridge, 1974.
4. A. Bouabdallah. Problems related to parallel and distributed systems. Thesis, Université de Paris-Sud, 1991.
5. C. GowriSankaran. Broadcasting on recursively decomposable Cayley graphs. Discrete Applied Mathematics, to appear.
6. M.-C. Heydemann, J. Opatrny, and D. Sotteau. Embeddings of complete binary trees into star graphs with congestion 1. In Proceedings of the 27th Hawaii International Conference of System Sciences, pages 546-554, 1995. Also Rapport LRI # 906.
7. J. Jwo, S. Lakshmivarahan, and S. Dhall. Embedding of cycles and grids in star graphs. Proceedings of the 2nd IEEE Parallel and Distributed Processing Symposium, Dallas, Texas, 1990.
8. Z. Miller, D. Pritikin, and I. Sudborough. Small dilation embeddings of hypercubes into star networks. Research Report TX 75083, University of Texas at Dallas.
9. B. Monien and H. Sudborough. Embedding one interconnection network in another. Computing Supplement, 7:257-282, 1990.
10. M. Nigam, S. Sahni, and B. Krishnamurthy. Embedding hamiltonians and hypercubes in the star interconnection graphs. Proceedings of the International Conference on Parallel Processing, pages III.340-III.343, 1990.