Efficient Embeddings into Hypercube-like Topologies

Computer Journal

Volumn 46, Issue 6, 2003, Pages 632-644

  Heun, Volker ^a   Mayr, Ernst W ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

STAR GRAPHS;

COMPUTER NETWORKS;

EID: 0242332685     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.6.632     Document Type: Article

References (52)

1. Havel, I. M. and Liebl, P. (1973) Embedding the polytomic tree into the n-cube. Časopis. Pěst. Mat., 98, 307-314.
2. Saad, Y. and Schulz, M. (1985) Topological Properties of the Hypercube. Technical Report RR-389, Yale University.
3. Bhatt, S. N. and Ipsen, I. (1985) How to Embed Trees in Hypercubes. Technical Report RR-443, Yale University.
4. Wu, A.Y. (1985) Embedding of tree networks into hypercubes. J. Parallel Distrib. Comput., 2, 238-249.
5. Stout, Q. F. (1986) Hypercubes and pyramids. In Proc. NATO Advanced Research Workshop on Pyramidal Systems for Image Processing and Computer Vision, Maratea, Italy, 59 May, pp. 75-89. Springer, Berlin.
6. Chan, M. Y (1989) Embedding of d-dimensional grids into optimal hypercubes. In Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures, SPAA '89, Santa Fe, NM, June 18-21, pp. 52-57. ACM Press, New York.
7. Efe, K. (1991) Embedding mesh of trees in the hypercube. J. Parallel Distrib. Comput., 11, 222-230.
8. Chan, M. Y. (1991) Embedding of grids into optimal hypercubes. SIAM J. Comput., 20, 834-864.
9. Sheen, X., Hu, Q. and Liang, W. (1995) Embedding k-ary complete trees into hypercubes. J. Parallel Distrib. Comput., 24, 100-106.
10. Chan, M. Y., Chin, F. Y., Chu, C. N. and Mak, W. K. (1996) Dilation-5 embedding of 3-dimensional grids into hypercubes. J. Parallel Distrib. Comput., 33, 98-106.
11. Heun, V. and Mayr, E. W. (1996) Optimal dynamic edge-disjoint embeddings of complete binary trees into hypercubes. In Proc. Fourth Int. Workshop on Parallel Systems and Algorithms, PASA '96, Jülich, Germany, April 10-12, pp. 195-209. World Scientific, Singapore.
12. Trdliçka, J. and Tvrdík, P. (1998) Embedding k-ary complete trees into hypercubes with uniform load. J. Parallel Distrib. Comput., 52, 120-131.
13. Heun, V. and Mayr, E. W. (2001) Optimal dynamic embeddings of complete binary trees into hypercubes. J. Parallel Distrib. Comput., 61, 1110-1125.
14. Wagner, A. and Cornell, D. G. (1990) Embedding tree in a hypercube is NP-complete. SIAM J. Comput., 19, 570-590.
15. Wagner, A. and Corneil, D. G. (1993) On the complexity of the embedding problem for hypercube related graphs. Discrete Appl. Math., 43, 75-95.
16. Bhatt, S. N., Chung, F. R. K., Leighton, F. T. and Rosenberg, A. L. (1986) Optimal simulations of tree machines. In Proc. 27th IEEE Symp. on Foundations of Computer Science, FOCS '86, Toronto, Canada, October 27-29, pp. 274-282. IEEE Computer Society Press, Los Alamitos.
17. Bhatt, S. N., Chung, F. R. K., Leighton, F. T. and Rosenberg, A. L. (1992) Efficient embeddings of trees in hypercubes. SIAM J. Comput., 21, 151-162.
18. Monien, B. and Sudborough, I. H. (1988) Simulating binary trees on hypercubes. In Proc. Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC '88, Corfu, Greece, June 28-July 1. Lecture Notes in Computer Science, 319, 170-180. Springer, Berlin.
19. Heun, V. and Mayr, E. W. (1996) A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube. J. Algorithms, 20, 375-399.
20. Havel, I. M. (1984) On Hamiltonian circuits and spanning trees of hypercubes (in Czech). Časopis. Pěst. Mat., 109, 145-152.
21. Havel, I. M. and Liebl, P. (1986) One-legged caterpillars span hypercubes. J. Graph Theory, 10, 69-76.
22. Bezrukov, S. L., Monien, B., Unger, W. and Wechsung, G. (1998) Embedding ladders and caterpillars into the hypercube. Disc. Appl. Math., 82, 19-27.
23. Heun, V. and Mayr, E. W. (1996) Embedding graphs with bounded treewidth into optimal hypercubes. In Proc. 13th Symposium on Theoretical Aspects of Computer Science, STACS '96, Grenoble, France, February 22-24. Lecture Notes in Computer Sciences, 1046, 157-168. Springer, Berlin.
24. Heun, V. and Mayr, E. W. (2002) Embedding graphs with bounded treewidth into optimal hypercubes. J. Algorithms, 43, 17-50.
25. Schwartz, J. (1980) Ultracomputers. ACM Trans. Program. Lang. Syst., 2, 484-521.
26. Mayr, E. W. and Plaxton, C. G. (1993) Pipelined parallel prefix computations and sorting on a pipelined hypercube. J. Parallel Distrib. Comput., 17, 639-654.
27. Nassimi, D. and Sahni, S. (1981) Data broadcasting in SIMD computers. IEEE Trans. Comput., C-30, 101-107.
28. Nassimi, D. and Sahni, S. (1982) Parallel algorithms to set up the benes permutation network. IEEE Trans. Comput., C-31, 148-154.
29. Nassimi, D. and Sahni, S. (1982) Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM, 29, 642-667.
30. Cypher, R. and Plaxton, C. G. (1993) Deterministic sorting in nearly logarithmic time on the hypercube and related computers. J. Comput. Syst. Sci., 47, 501-548.
31. Alon, N. and West, D. B. (1986) The Borsuk-Ulam theorem and bisection of necklaces. Proc. Am. Math. Soc., 98, 623-628.
32. Goldberg, C. H. and West, D. B. (1985) Bisection of circle colorings. SIAM J. Alg. Disc. Meth., 6, 93-106.
33. Robertson, N. and Seymour, P. D. (1983) Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35, 39-61.
34. Robertson, N. and Seymour, P. D. (1986) Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7, 309-322.
35. Bodlaender, H. L. (1988) Some classes of graphs with bounded treewidth. EATCS Bulletin, 36, 116-126.
36. Hilbers, P. A., Koopman, M. R. and van de Snepscheut, J. L. A. (1987) The twisted cube. In Proc. First Int. Conf. on Parallel Architectures and Languages Europe, PARLE '87, Eindhoven, The Netherlands, June 15-19. Lecture Notes in Computer Science, 258, 783-784. Springer, Berlin.
37. Latifi, S. and El-Amawy, A. (1989) On folded hypercubes. In Proc. 1989 Int. Conf. on Parallel Processing, ICPP '89, Vol. 1: Architecture, August 8-12, pp. 180-187. Pennsylvania State University Press, University Park, London.
38. Hillis, W. D. (1981) The Connection Machine. Technical Report, MIT AI Memo 646, Massachusetts Institute of Technology.
39. Chedid, F. B. and Chedid, R. B. (1993) A new variation on hypercubes with smaller diameter. Inf. Process. Lett., 46, 275-280.
40. Efe, K. (1991) A variation on the hypercube with lower diameter. IEEE Trans. Comput., C-40, 1312-1316.
41. Efe, K. (1992) The crossed cube architecture for parallel computation. IEEE Trans. Parallel Distrib. Systems, 3, 513-524.
42. Cull, P. and Larson, S. M. (1995) The Möbius cube. IEEE Trans. Comput., C-44, 647-659.
43. Katseff, H. P. (1988) Incomplete hypercube. IEEE Trans. Comput., C-37, 604-607.
44. Hsu, W.-J. (1993) Fibonacci cubes - a new interconnection topology. IEEE Trans. Parallel Distrib. Syst., 1, 3-12.
45. Öhring, S. R. and Das, S. K. (1993) The folded Petersen network: A new communication-efficient multiprocessor topology. In Proc. 1993 Int. Conf. on Parallel Processing, ICPP '93. Vol. I: Architecture, St. Charles, Illinois, August 16-20, pp. 311-314. CRC Press, Boca Raton.
46. Öhring, S. R. and Das, S. K. (1993) The folded Petersen network: A new versatile multiprocessor interconnection topology. In Proc. 19th Int. Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, Utrecht, The Netherlands, June 16-18. Lecture Notes in Computer Sciences, 790, 301-314. Springer, Berlin, Heidelberg, New York.
47. Akers, S. B., Harel, D. and Krishnamurthy, B. (1987) The star graph: An attractive alternative to the n-cube. In Proc. 1987 Int. Conf. on Parallel Processing, ICPP '87, August 17-21, pp. 393-400. Pennsylvania State University Press, University Park, London.
48. Leighton, F. T., Newman, M., Ranade, A. G. and Schwabe, W. H. (1989) Dynamic tree embeddings in butterflies and hypercubes. In Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures, SPAA '89, Santa Fe, NM, June 18-21, pp. 224-234. ACM Press, New York.
49. Leighton, F. T., Newman, M., Ranade, A. G. and Schwabe, W. J. (1992) Dynamic tree embeddings in butterflies and hypercubes. SIAM J. Comput., 21, 639-654.
50. Bhatt, S. N. and Cai, J.-Y. (1993) Taking random walks to grow trees in hypercubes. J. ACM, 40, 741-764.
51. Heun, V. and Mayr, E. W. (1996) Efficient dynamic embeddings of arbitrary binary trees into hypercubes. In Proc. Third Int. Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '96, Santa Barbara, CA, August 19-21. Lecture Notes in Computer Science, 1117, 287-298. Springer, Berlin.
52. Heun, V. and Mayr, E. W. (2002) Efficient dynamic embeddings of arbitrary binary trees into hypercubes. J. Algorithms, 43, 51-84.