Sciweavers

SODA
2003
ACM

138views Algorithms» more SODA 2003»

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

14 years 1 months ago

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 rearr...

Hung Q. Ngo, Van H. Vu

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers