Pancake problems with restricted prefix reversals and some corresponding Cayley networks
暂无分享,去创建一个
[1] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[2] Ivan Stojmenovic,et al. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry , 1993, Networks.
[3] D. Robinson. A Course in the Theory of Groups , 1982 .
[4] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[5] George W. Polites,et al. An introduction to the theory of groups , 1968 .
[6] Marie-Claude Heydemann,et al. Cayley graphs and interconnection networks , 1997 .
[7] Chris Godsil. Connectivity of minimal Cayley graphs , 1981 .
[8] W. Mader. Minimale n-fach kantenzusammenh angende graphen , 1971 .
[9] Zevi Miller,et al. Embedding hypercubes into pancake, cycle prefix and substring reversal networks , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.
[10] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[11] Afonso Ferreira,et al. Optimal information dissemination in Star and Pancake networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.
[12] Ivan Hal Sudborough,et al. On the shuffle-exchange permutation network , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).
[13] Arnold L. Rosenberg,et al. Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..
[14] Ivan Stojmenovic,et al. Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[15] Ivan Hal Sudborough,et al. On the Diameter of the Pancake Network , 1997, J. Algorithms.
[16] Selim G. Akl,et al. A Novel Routing Scheme on the Star and Pancake Networks and its Applications , 1993, Parallel Comput..
[17] Behrooz Parhami,et al. A class of fixed-degree Cayley-graph interconnection networks derived by pruning k-ary n-cubes , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).
[18] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[19] Shahram Latifi,et al. A new fixed degree regular network for parallel processing , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.
[20] Christos H. Papadimitriou,et al. Bounds for sorting by prefix reversal , 1979, Discret. Math..
[21] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[22] Pradip K. Srimani,et al. Trivalent Cayley Graphs for Interconnection Networks , 1995, Inf. Process. Lett..
[23] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[24] S. Lakshmivarahan,et al. Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..
[25] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[26] Frank Thomson Leighton. Introduction to parallel algorithms and architectures: arrays , 1992 .
[27] Manuel Blum,et al. on the Problem of Sorting Burnt Pancakes , 1995, Discret. Appl. Math..
[28] M. Watkins. Connectivity of transitive graphs , 1970 .
[29] Zevi Miller,et al. Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group , 1994, IEEE Trans. Computers.
[30] Pradip K. Srimani,et al. Shortest Routing in Trivalent Cayley Graph Network , 1996, Inf. Process. Lett..