Control Algorithms for Rearrangeable Clos Networks
From MaRDI portal
Publication:4749219
Cited in
(4)- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- A rearrangement algorithm for switching networks composed of digital symmetrical matrices
- Conjectured \textit{DXZ} decompositions of a unitary matrix
This page was built for publication: Control Algorithms for Rearrangeable Clos Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749219)