
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.A. Sridhar, "A Fast Algorithm for Testing Isomorphism of Permutation Networks," IEEE Transactions on Computers, vol. 38, no. 6, pp. 903909, June, 1989.  
BibTex  x  
@article{ 10.1109/12.24304, author = {M.A. Sridhar}, title = {A Fast Algorithm for Testing Isomorphism of Permutation Networks}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {6}, issn = {00189340}, year = {1989}, pages = {903909}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.24304}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Fast Algorithm for Testing Isomorphism of Permutation Networks IS  6 SN  00189340 SP903 EP909 EPD  903909 A1  M.A. Sridhar, PY  1989 KW  isomorphism; permutation networks; conjugate; HopcroftTarjan algorithm; planar graph isomorphism; multiprocessor interconnection networks; network topology. VL  38 JA  IEEE Transactions on Computers ER   
[1] D. P. Agrawal, "Graphtheoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C32, pp. 637648, July 1983.
[2] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: AddisonWesley, 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. 203225, 1981.
[7] M. Crochemore, "An optimal algorithm for computing the repetitions in a word,"Inform. Processing Lett., vol. 12, pp. 244250, Oct. 1981.
[8] T.Y. Feng, "A survey of interconnection networks,"IEEE Computer, vol. 14, pp. 1227, 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. 189196.
[10] J. E. Hopcroft and R. E. Tarjan, "AVlogValgorithm for isomorphism of triconnected planar graphs,"J. Comput. Syst. Sci., vol. 7, pp. 323331, 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. 172184, April, 1974.
[12] Y. A. Oruc and M. Y. Oruc, "On testing isomorphism of permutations networks,"IEEE Trans. Comput., vol. C34, pp. 958962, Oct. 1985.
[13] R. C. Read and C. G. Corneil, "The graph isomorphism disease,"J. Graph Theory, vol. 1, pp. 339363, 1977.
[14] J. J. Rotman,Theory of Groups. Boston, MA: Allyn and Bacon, 1965.