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

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: Hung Q. Ngo, Van H. Vu
• Keywords: Algorithms, Minimum Number, SIAM J, SODA 2003, Symmetric 3-stage Clos