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

DOI10.1137/S0097539702408235zbMath1052.68012OpenAlexW2062207559MaRDI QIDQ4429671

Van H. Vu, Hung Quang 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

zbMATH Keywords

bipartite graphClos networkgeneralized edge-coloringmultirate rearrangeable

Mathematics Subject Classification ID

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

Related Items (1)

Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors

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