Control Algorithms for Rearrangeable Clos Networks

DOI10.1109/TCOM.1983.1095923MaRDI QIDQ4749219zbMATH OpenOpenAlexFDO

Authors Frank K. Hwang

Publication date 1983

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1983.1095923

zbMATH Keywords

bipartite graphsedge coloring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited in

(5)

• A rearrangement algorithm for switching networks composed of digital symmetrical matrices
• Conjectured \textit{DXZ} decompositions of a unitary matrix
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• Impossibility results for data-center routing with congestion control and unsplittable flows
• Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks

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)