Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A new routing algorithm for multirate rearrangeable Clos networks
Theoretical Computer Science
On rearrangeable multirate three-stage Clos networks
Theoretical Computer Science
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
Hi-index | 0.00 |