On VLSI layouts of the star graph and related networks

Akers, 1987, The star graph: an attractive alternative to the n-cube, 393 Akers, 1989, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput., 38, 555, 10.1109/12.21148 Akl, 1991, A parallel algorithm for computing Fourier transforms on the star graph, 100 Akl, 1991, Decomposing a star graph into disjoint cycles, Inform. Process. Lett., 39, 125, 10.1016/0020-0190(91)90107-S Akl, 1992, Parallel minimum spanning forest algorithm on the star and pancake interconnection networks, Vol. 634, 565 Brebner, 1985, Relating routing graphs and two dimensional array grids Day, 1992, Arrangement graphs: a class of generalized star graphs, Inform. Process. Lett., 42, 235, 10.1016/0020-0190(92)90030-Y Dhall, 1990, Embedding of cycles and grids in star graphs, 540 Gordon, 1991, Parallel sorting on Cayley graphs, Algorithmica, 6, 554, 10.1007/BF01759059 Erdös, 1973, Crossing number problems, Amer. Math. Monthly, 80, 52, 10.1080/00029890.1973.11993230 Gates, 1979, Bounds for sorting by prefix reversal, Discrete Math., 27, 47, 10.1016/0012-365X(79)90068-2 Gazit, 1990, Planar separators and the Euclidean norm, 338 Krishnamurthy, 1990, Embedding hamiltonians and hypercubes in the star interconnection graph, 340 Leighton, 1983 Leiserson, 1980, Area efficient graph layouts (for VLSI), 270 Lipton, 1979, A separator theorem for planar graphs, SIAM J. Appl. Math., 36, 177, 10.1137/0136016 Menn, 1990, An efficient sorting algorithm for the star interconnection network, 1 Rajasekaran, 1993, Selection, routing, and sorting on the star graph Shahrokhi, 1991, An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications Shahrokhi, 1992, Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry F. Shahrokhi, O. Sýkora, L.A. Székely and I. Vrt'o, The crossing number of a graph on a compact 2-manifold, Adv. in Math. (to appear). Sýkora, 1992, On crossing numbers of hypercubes and cube connected cycles, BIT, 32 Thompson, 1979, Area-time complexity for VLSI, 81