Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs

DOI10.1137/S0097539702408235zbMATH Open1052.68012OpenAlexW2062207559MaRDI QIDQ4429671FDOQ4429671

Authors: Van Vu, Hung Q. Ngo 

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702408235

Recommendations

• scientific article; zbMATH DE number 2079420
• On Multirate Rearrangeable Clos Networks
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• On Rearrangeability of Multirate Clos Networks
• scientific article; zbMATH DE number 1769311

zbMATH Keywords

bipartite graphClos networkgeneralized edge-coloringmultirate rearrangeable

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)

Cited In (8)

• On Rearrangeability of Multirate Clos Networks
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• Title not available (Why is that?)
• Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
• Applications of matching and edge‐coloring algorithms to routing in clos networks
• Title not available (Why is that?)
• An approximate König's theorem for edge-coloring weighted bipartite graphs
• Title not available (Why is that?)

This page was built for publication: Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429671)