scientific article; zbMATH DE number 2079420
From MaRDI portal
Publication:4471380
Recommendations
- Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
- On Multirate Rearrangeable Clos Networks
- Improved Bounds on Nonblocking 3-Stage Clos Networks
- On Rearrangeability of Multirate Clos Networks
- A new routing algorithm for multirate rearrangeable Clos networks.
Cited in
(9)- Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
- On Rearrangeability of Multirate Clos Networks
- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
- Edge Coloring and Decompositions of Weighted Graphs
- Improved Bounds on Nonblocking 3-Stage Clos Networks
- scientific article; zbMATH DE number 3503132 (Why is no real title available?)
- Applications of matching and edge‐coloring algorithms to routing in clos networks
- An approximate König's theorem for edge-coloring weighted bipartite graphs
- scientific article; zbMATH DE number 3982886 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471380)
