Author:
Morales Linda,Hal Sudborough I.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. S. Akers and B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks,” IEEE Trans. Comput., vol. C-38,no.4, pp. 555–566, 1989.
2. A. Bouabdallah, M. C. Heydemann, J. Opatrny, and D. Sotteau, “Embedding Complete Binary Trees into Star and Pancake Graphs,” Theory of Computer Systems, v. 31, pp. 279–305, 1998
3. D. S. Cohen and M. Blum, “Improved bounds for sorting pancakes under a conjecture,” Discrete Applied Mathematics, 1993
4. V. Faber, J.W. Moore, and W. Y. C. Chen, “Cycle prefix digraphs for symmetric intercon-nection networks,” Networks, vol. 23, John Wiley and Sons, 1993, pp. 641–649.
5. L. Morales, Z. Miller, D. Pritikin, and I. H. Sudborough, “One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals”, Theory of Computing Systems, 34, 2001, pp. 399–431.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献