Issue No. 06 - June (1989 vol. 38)

ISSN: 0018-9340

pp: 903-909

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24304

ABSTRACT

The problem of deciding whether two given permutation sequences are conjugate is addressed. The author exhibits an algorithm that solves this problem in time O(N log N), where N is the sum of the sizes of the two sequences. The algorithm can be applied to the problem of deciding whether two permutation networks are equivalent. The time bound for the algorithm is a significant improvement over t

INDEX TERMS

isomorphism; permutation networks; conjugate; Hopcroft-Tarjan algorithm; planar graph isomorphism; multiprocessor interconnection networks; network topology.

CITATION

M.A. Sridhar, "A Fast Algorithm for Testing Isomorphism of Permutation Networks",

*IEEE Transactions on Computers*, vol. 38, no. , pp. 903-909, June 1989, doi:10.1109/12.24304