This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast Algorithm for Testing Isomorphism of Permutation Networks
June 1989 (vol. 38 no. 6)
pp. 903-909
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

[1] D. P. Agrawal, "Graph-theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C-32, pp. 637-648, July 1983.
[2] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[3] N. L. Biggs,Algebraic Graph Theory. London, England: Cambridge University Press, 1974.
[4] A. Cardon and M. Crochemore, "Partitioning a graph inO(
[5] G. Chartrand and L. Lesniak,Graphs and Digraphs. Wadsworth, Monterey, 1986.
[6] C. J. Colbourn and K. S. Booth, "Linear time automorphism algorithms for trees, interval graphs, and planar graphs,"SIAM J. Comput., vol. 10, pp. 203-225, 1981.
[7] M. Crochemore, "An optimal algorithm for computing the repetitions in a word,"Inform. Processing Lett., vol. 12, pp. 244-250, Oct. 1981.
[8] T.-Y. Feng, "A survey of interconnection networks,"IEEE Computer, vol. 14, pp. 12-27, Dec. 1981.
[9] J. E. Hopcroft, "Annlognalgorithm for minimizing the states in a finite automaton," inTheory of Machines and Computations, Z. Kohavi and A. Paz, Fds. New York: Academic, pp. 189-196.
[10] J. E. Hopcroft and R. E. Tarjan, "AVlogValgorithm for isomorphism of triconnected planar graphs,"J. Comput. Syst. Sci., vol. 7, pp. 323-331, 1973.
[11] J. Hopcroft and J. Wong, "Linear time algorithm for isomorphism of planar graphs," inProc. 6th Annual ACM Symp. Theory of Computing, New York, pp. 172-184, April, 1974.
[12] Y. A. Oruc and M. Y. Oruc, "On testing isomorphism of permutations networks,"IEEE Trans. Comput., vol. C-34, pp. 958-962, Oct. 1985.
[13] R. C. Read and C. G. Corneil, "The graph isomorphism disease,"J. Graph Theory, vol. 1, pp. 339-363, 1977.
[14] J. J. Rotman,Theory of Groups. Boston, MA: Allyn and Bacon, 1965.

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. 6, pp. 903-909, June 1989, doi:10.1109/12.24304
Usage of this product signifies your acceptance of the Terms of Use.