scientific article; zbMATH DE number 2079420

zbMATH Open1092.68632MaRDI QIDQ4471380FDOQ4471380

Authors: Van Vu, Hung Q. Ngo 

Publication date: 28 July 2004

Title of this publication is not available (Why is that?)

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.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

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
• Title not available (Why is that?)
• Applications of matching and edge‐coloring algorithms to routing in clos networks
• An approximate König's theorem for edge-coloring weighted bipartite graphs
• Title not available (Why is that?)

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)