Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. S.B. Akers and B. Krishnamurthy, “A Group Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. on Compu., Vol. c-38, No. 4 (1989) 555–566.
2. S.B. Akers, D. Harel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the n-cube,” Proc ICPP, (1987) 393–400.
3. S.K. Das, N. Deo, and S. Prasad, “Parallel Graph Algorithms for Hypercube Computers,” Parallel Computing, Vol. 13 (1990) 143–158.
4. S.K. Das, N. Deo, and S. Prasad, “Two Minimum Spanning Forest Algorithms on Fixedssize Hypercube Computers,” Parallel Computing, Vol. 15 (1990) 179–187.
5. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland, 1978.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献