On Multirate Rearrangeable Clos Networks

DOI10.1137/S0097539795284716zbMATH Open0935.94032MaRDI QIDQ4210158FDOQ4210158

Authors:

Publication date: 21 September 1998

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

Recommendations

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

zbMATH Keywords

rearrangeableClos networkmultirate switching

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonblocking Multirate Networks
• On Nonblocking Multirate Interconnection Networks

Cited In (11)

• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• On Rearrangeability of Multirate Clos Networks
• A New Approach for Rearrangeable Multicast Switching Networks
• Edge Coloring and Decompositions of Weighted Graphs
• Wide-sense nonblocking for multirate 3-stage Clos networks
• On rearrangeable multirate three-stage Clos networks
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• A new routing algorithm for multirate rearrangeable Clos networks.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)