Sciweavers

Share
SODA
2003
ACM

Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs

9 years 23 days ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearrangeable in the multirate enviroment is at most
Hung Q. Ngo, Van H. Vu
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Hung Q. Ngo, Van H. Vu
Comments (0)
books