Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group

Theory of Computing Systems

Volumn 29, Issue 6, 1996, Pages 551-572

  Miller, Z ^a   Pritikin, D ^a   Sudborough, I H ^b  

^a MIAMI UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GEOMETRY; HYPERCUBE NETWORKS; STARS;

ARBITRARY DIMENSION; CAYLEY GRAPHS; HYPER-CUBES; NEAR OPTIMUM; PARALLEL COMPUTATION; STAR NETWORK; SYMMETRIC GROUPS; SYMMETRY PROPERTIES;

GRAPH THEORY;

EID: 0040264816     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01301964     Document Type: Article

References (9)

1. [AHK] S. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to the n-cube. Proceedings of the 1987 International Conference on Parallel Processing, pp. 393-400.
2. [AK1] S. Akers and B. Krishnamurthy. Group graphs as interconnection networks. Proceedings of the 14th International Conference on Fault Tolerant Computing, 1984, pp. 422-427.
3. [AK2] S. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers, Vol. 38, No. 4 (1989), pp. 555-566.
4. [BCH+] S. Bhatt, F. Chung, J.-W. Hong, F. T. Leighton, and A. Rosenberg. Optimal simulations by butterfly networks. Proceedings of the 23rd Annual ACM Theory of the Computer Science Conference, 1988, pp. 192-204.
5. [L] F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992, p. 776, Problem 3.355.
6. [JLD] J. S. Jwo, S. Lakshmivarahan, and S. K. Dhall. Embedding of cycles and grids in star graphs. Journal of Circuits, Systems, and Computers, Vol. 1, No. 1 (1991), 43-74.
7. [MPS] Z. Miller, D. Pritikin, and I. H. Sudborough. Near embeddings of hypercubes into Cayley graphs on the symmetric group. IEEE Transactions on Computers, Vol. 43, No. 1 (1994), 13-22.
8. [MS] B. Monien and I. H. Sudborough. Simulating binary trees on hypercubes. Proceedings of the 1988 AWOC Conference on VLSI Algorithms and Architectures, 1988. In Lecture Notes in Computer Science, Vol. 319. Springer-Verlag, pp. 170-180.
9. [NSK] M. Nigam, S. Sahni, and B. Krishnamurthy. Embedding hamiltonians and hypercubes in star interconnection graphs. Proceedings of the International Conference on Parallel Processing, 1990.