
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.B. Akers, B. Krishnamurthy, "A GroupTheoretic Model for Symmetric Interconnection Networks," IEEE Transactions on Computers, vol. 38, no. 4, pp. 555566, April, 1989.  
BibTex  x  
@article{ 10.1109/12.21148, author = {S.B. Akers and B. Krishnamurthy}, title = {A GroupTheoretic Model for Symmetric Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {4}, issn = {00189340}, year = {1989}, pages = {555566}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.21148}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A GroupTheoretic Model for Symmetric Interconnection Networks IS  4 SN  00189340 SP555 EP566 EPD  555566 A1  S.B. Akers, A1  B. Krishnamurthy, PY  1989 KW  grouptheoretic model; symmetric interconnection networks; Cayley graph model; finite groups; combinatorial problems; star graphs; pancake graphs; graph theory; multiprocessor interconnection networks. VL  38 JA  IEEE Transactions on Computers ER   
[1] Amer. Math. Monthly, vol. 82, no. 1, p. 1010, 1975.
[2] S. B. Akers and B. Krishnamurthy, "Group graphs as interconnection networks," inProc. 14th Int. Conf. Fault Tolerant Comput., 1984, pp. 422427.
[3] C. Berge, inPrinciples of Combinatorics. New York: Academic, 1971, p. 141.
[4] N. L. Biggs,Algebraic Graph Theory. Cambridge, MA: Cambridge University Press, 1974.
[5] J. A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: North Holland, 1979.
[6] F. E. Fich, "New bounds for parallel prefix circuits," inProc. 15th Annu. ACM Symp. Theory Comput., 1983, pp. 100109.
[7] E. Fuller and B. Krishnamurthy, "Symmetries in graphs: An annotated bibliography," Tektronix Lab. Tech. Rep. CR8603, 1986.
[8] W. H. Gates and C. H. Papadimitriou, "Bounds for sorting by prefix reversal,"Discrete Math, vol. 27, pp. 4757, 1979.
[9] I. N. Herstein,Topics in Algebra. Blaisdel, 1964.
[10] C. Hoffman,Group Theoretic Algorithms and Graph Isomorphism. New York: SpringerVerlag, 1982.
[11] R. E. Ladner and M. J. Fischer, "Parallel prefix computation,"J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[12] F. T. Leighton,Complexity Issues in VLSI: Optimal Layouts for the ShuffleExchange Graph and Lower Bound Techniques for VLSI. Cambridge, MA: M.I.T. Press, 1983.
[13] M. C. Pease, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, 1977.
[14] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[15] G. Sabidussi, "Vertex transistive graphs,"Monatsh. Math.vol. 68, pp. 426438, 1968.
[16] M. R. Samatham and D. K. Pradhan, "A multiprocessor network suitable for singlechip VLSI implementation," inProc. 11th Symp. Comput. Architect., June 1984, pp. 328337.
[17] C. L. Seitz, "Concurrent VLSI architectures,"IEEE Trans. Comput., pp. 12471265, 1984.
[18] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, 1971.
[19] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984, pp. 209243.
[20] S. Zaks, "A new algorithm for generation of permutations," Tech. Rep. 220, TechnionIsrael Instit. Technol., 1981.