This Article 
 Bibliographic References 
 Add to: 
Oct. 1985 (vol. 34 no. 10)
pp. 958-962
A. Yavuz Oruc, Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY 12180
M. Yaman Oruc, Department of Mathematics, Syracuse University, Syracuse, NY 13210
A large set of interconnection schemes, collectively referred to as multistage permutation networks, has emerged in the literature as a means for providing parallel communications in multiprocessing systems. It is known that most of these networks cannot realize every permutation over their terminal nodes. This fact has prompted research on functional relations among such networks. The correspondence deals with one aspect of this research, namely, the problem of constructing equivalence maps between two permutation networks. A branch-and-bound algorithm is given to test whether two such networks are equivalent in polynomial time. Whenever they are, the algorithm also determines a map that conjugates one network onto the other.
Index Terms:
permutation network,Conjugation map,cycle map,functional equivalence,network isomorphism,permutation map
A. Yavuz Oruc, M. Yaman Oruc, "On testing isomorphism of permutation networks," IEEE Transactions on Computers, vol. 34, no. 10, pp. 958-962, Oct. 1985, doi:10.1109/TC.1985.6312200
Usage of this product signifies your acceptance of the Terms of Use.