On Multirate Rearrangeable Clos Networks

DOI10.1137/S0097539795284716zbMath0935.94032MaRDI QIDQ4210158

No author found.

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

rearrangeableClos networkmultirate switching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

On rearrangeable multirate three-stage Clos networks ⋮ Wide-sense nonblocking for multirate 3-stage Clos networks ⋮ A new routing algorithm for multirate rearrangeable Clos networks. ⋮ Edge Coloring and Decompositions of Weighted Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On Nonblocking Multirate Interconnection Networks
• Nonblocking Multirate Networks

This page was built for publication: On Multirate Rearrangeable Clos Networks