论文信息 - Decomposing a Star Graph Into Disjoint Cycles

Decomposing a Star Graph Into Disjoint Cycles

Abstract The star graph was proposed by S.B. Akers, D. Harel, and B. Krishnamurthy as an attractive alternative to the n -cube for interconnecting processors on a parallel computer. In this paper, we show that an n -star can be decomposed into ( n −2)! vertex disjoint cycles of lenght ( n −1) n . These cycles may be used in designing parallel algorithms on an interconnection network based on the star topology.

Selim G. Akl | Ke Qiu | Henk Meijer

[1] David Y. Y. Yun,et al. Multi-dimensional systolic networks, for discrete fourier transform , 1984, ISCA 1984.

[2] Selim G. Akl,et al. Design and analysis of parallel algorithms , 1985 .

[3] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[4] Shmuel Zaks,et al. A new algorithm for generation of permutations , 1984, BIT.

[5] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[6] Sartaj Sahni,et al. Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[7] S. Lakshmivarahan,et al. Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.