The shuffle exchange network has a Hamiltonian path
The problem to determine whether a network contains a Hamiltonian path has been a. fundamental problem in graph theory. We prove the existence of a Hamiltonian path in the Shuffle Exchange network SX(n). This problem has been posed as an open problem by Leighton in  and Samatham and Pradhan in .
KeywordsHamiltonian Path Gray Code Block Number Block Versus Cycle Network
Unable to display preview. Download preview PDF.
- 4.Rainer Feldmann, Walter UngerThe Cube-Connected Cycles Network is a Subgraph of the Butterfly Network. submitted to Parallel Processing Letters, (1991)Google Scholar
- 5.Rainer Feldmann, Peter Mysliwietz, Stefan TschökeThe Shuffle Exchange Network of Dimension2Has a Hamiltonian Path. unpublished manuscript, 1991Google Scholar
- 6.E. N. GilbertGray Codes and Paths on then-Cube. Bell System Technical Journal 37, pp 815–826, (1957)Google Scholar
- 8.F. Thomson LeightonIntroduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes Morgan Kaufmann Publishers, Chapter 3, page 509, (1991)Google Scholar
- 10.Franco P. Preparata, J. VuilleminThe Cube-Connected-Cycles. A Versatile Network for Parallel Computation. IEEE FOCS vol. 20, pp140–147, (1979)Google Scholar
- 13.Harold S. StoneParallel Processing with the Perfect Shuffle. IEEE Transactions on Computers vol. C-20, no. 2, pp 153–161, (1971)Google Scholar