Title :
On testing isomorphism of permutation networks
Author :
Oruc, A.Y. ; Oruc, M.Y.
Author_Institution :
Dept. of Electr., Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA
Abstract :
The problem of constructing equivalence maps between two multistage permutation networks is considered. 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.
Keywords :
computer networks; branch-and-bound algorithm; equivalence maps; isomorphism testing; multistage permutation networks; polynomial time; Educational institutions; Multiprocessor interconnection; Parallel processing; Polynomials; Program processors; Testing; Tin; Conjugation map; cycle map; functional equivalence; network isomorphism; permutation map; permutation network;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1985.6312200
