Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Baumslag, M., F. Annexstein, ‘A Unified Framework for Off-Line Permutation Routing in Parallel Networks,’ Mathematical Systems Theory, 24(4), pp. 233–251, 1991.
2. Chlebus, B.S., A. Czumaj, L. Gasieniec, M. Kowaluk, W. Plandowski, ‘Parallel Alternating-Direction Access Machine,’ Proc. 21st Mathematical Foundations of Computer Science, LNCS. 1113, pp. 267–278, Springer-Verlag, 1996.
3. Chlebus, B.S., A. Czumaj, J.F. Sibeyn, ‘Routing on the PADAM: Degrees of Optimality,’ Proc. 3rd Euro-Par Conference, LNCS. 1300, pp. 272–279, Springer-Verlag, 1997.
4. Cole, R., J. Hopcroft, ‘On Edge Coloring Bipartite Graphs,’ SIAM Journal on Computing, 11, p. 540–546, 1982.
5. JáJá, J., An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Inc., 992.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cost of Bandwidth-Optimized Sparse Mesh Layouts;Lecture Notes in Computer Science;2015
2. Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness;International Journal of Distributed Systems and Technologies;2012-10
3. Hot-potato routing algorithms for sparse optical torus;Proceedings International Conference on Parallel Processing Workshops