Balanced permutations and multistage interconnection networks

References

• Linial , N. and Tarsi , M. 1989 . Interpolation between bases and the Shuffle-Exchange network . Europ. J. Combinatorics , 10 : 29 – 39 .
   Google Scholar
• Bondy , J.A. and Murty , U.S.R. 1979 . Graph Theory with Applications , New York : North-Holland .
   Google Scholar
• Çam , H. and Fortes , J.A.B. 1995 . Frames: a simple characterization of permutations realized by frequently used networks . IEEE Trans, on Compute , 44 ( 5 ) May : 695 – 697 .
   Google Scholar
• Wu , C. and Feng , T.Y. 1980 . On a class of multistage interconnection networks . IEEE Trans, on Compute , C-29 ( 5 ) May : 696 – 702 .
   Google Scholar
• Stone , H.S. 1971 . Parallel processing with the perfect shuffle . IEEE Trans, on Compute , C-20 ( 5 ) Feb : 153 – 161 .
   Google Scholar
• Oruc , A.Y. and Oruc , M.Y . 1985 . Equivalence relations among interconnection networks . J. of Parallel and Distributed Computing , 2 ( 5 ) Feb : 30 – 49 .
   Google Scholar
• Bcnes , V.E. 1965 . Mathematical Theory of Connecting Networks and Telephone Traffic , Academic Press .
   Google Scholar