Complete binary trees in folded and enhanced cubes

Networks

Volumn 43, Issue 4, 2004, Pages 266-272

  Choudum, S A ^a   Nandini, R Usha ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Binary tree; Embedding; Enhanced cube; Folded cube; Graph; Hypercube; Network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; FAULT TOLERANT COMPUTER SYSTEMS; PROBLEM SOLVING; ROUTERS; THEOREM PROVING;

EMBEDDING; ENHANCED CUBE; FOLDED CUBE; HYPERCUBE;

TREES (MATHEMATICS);

EID: 3042652954     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20002     Document Type: Article

References (10)

1. A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes, IEEE Transact Parallel Distributed Syst 2 (1991), 31-42.
2. S. Latifi, S.Q. Zheng, and N. Bagherzadeh, Optimal ring embedding in hypercubes with faulty links, Proc. 22nd IEEE International Symposium on Fault-Tolerant Computing, 1992, pp. 178-184.
3. F.T. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
4. M.L. Livingston and Q.F. Stout, Fault tolerance of the cyclic buddy subcube location scheme in hypercubes, Proc. 6th IEEE Distributed Memory Computing Conference, 1991, pp. 34-41.
5. B. Monien and H. Sudborough, Embedding one interconnection network in another, Comput Suppl 7 (1990), 257-282.
6. M.J. Quinn, Parallel computing: Theory and practice, McGraw-Hill (International Edition), Singapore, 1994.
7. N.F. Tzeng and S. Wei, Enhanced hypercubes, IEEE Transact Comput 40 (1991), 284-294.
8. D. Wang, On embedding binary trees into folded hypercubes, Congressus Numerantium 134 (1998), 89-97.
9. D. Wang, Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model, IEEE Transact Comput 48 (1999), 1369-1374.
10. D. Wang, Embedding Hamiltonian cycles into folded hypercubes with faulty links, J Parallel Distributed Comput 61 (2001), 545-564.