Applications of matching and edge‐coloring algorithms to routing in clos networks
From MaRDI portal
Publication:4313624
DOI10.1002/net.3230240603zbMath0822.90058OpenAlexW2027472000MaRDI QIDQ4313624
John D. Carpinelli, A. Yavuz Oruç
Publication date: 27 November 1994
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230240603
Related Items (4)
Improved edge-coloring with three colors ⋮ Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks ⋮ A new routing algorithm for multirate rearrangeable Clos networks. ⋮ The number of rearrangements for Clos networks -- new results
Cites Work
This page was built for publication: Applications of matching and edge‐coloring algorithms to routing in clos networks