Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks

DOI10.1007/S10852-008-9090-0zbMath1176.68019OpenAlexW2124476187MaRDI QIDQ841605

Kaj Holmberg

Publication date: 18 September 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18834

zbMATH Keywords

optimizationmatchingedge coloringswitchesclos networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• On Edge Coloring Bipartite Graphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Applications of matching and edge‐coloring algorithms to routing in clos networks
• Control Algorithms for Rearrangeable Clos Networks

This page was built for publication: Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks