On Multirate Rearrangeable Clos Networks

DOI10.1137/S0097539795284716MaRDI QIDQ4210158zbMATH OpenFDO

Authors

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)

Recommendations

• On Rearrangeability of Multirate Clos Networks
• On rearrangeable multirate three-stage Clos networks
• scientific article; zbMATH DE number 1535251

Cites work

• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 3353065 (Why is no real title available?)
• Nonblocking Multirate Networks
• On Nonblocking Multirate Interconnection Networks

Cited in

(11)

• A new routing algorithm for multirate rearrangeable Clos networks.
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• Wide-sense nonblocking for multirate 3-stage Clos networks
• scientific article; zbMATH DE number 3503132 (Why is no real title available?)
• A New Approach for Rearrangeable Multicast Switching Networks
• On rearrangeable multirate three-stage Clos networks
• On Rearrangeability of Multirate Clos Networks
• scientific article; zbMATH DE number 2079420 (Why is no real title available?)
• scientific article; zbMATH DE number 1535251 (Why is no real title available?)
• Edge Coloring and Decompositions of Weighted Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210158)