Reconfiguration Algorithms for Interconnection Networks
A. Yavuz Oruç, M. Yaman Oruc, Norman Balabanian · IEEE Transactions on Computers · 1985
The correspondence examines the functional relations within a class of multistage interconnection networks. It is known that these networks are not rearrangeable. This fact has led to some research on interconnection network relations. The correspondence deals with one aspect of this research, namely, that of constructing an equivalence map between two interconnection networks. Procedures are given to test whether two such networks are equivalent. Whenever they are, these procedures also produce a map to conjugate one network onto the other.