On multirate rearrangeable Clos networks

SIAM Journal on Computing

Volumn 28, Issue 2, 1998, Pages 463-470

  Du, D Z ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

CLOS NETWORKS;

SWITCHING NETWORKS;

EID: 0032107998     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795284716     Document Type: Article

References (1)

1. V. E. BENEŠ, Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.