scientific article; zbMATH DE number 1769311

DOI10.1002/(SICI)1097-0037(199809)32:2%3C77::AID-NET1%3E3.0.CO;2-FMaRDI QIDQ4540067zbMATH OpenFDO

Authors Yiu Kwok Tham

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199809)32:2%3C77::AID-NET1%3E3.0.CO;2-F

zbMATH Keywords

Clos networkcomputational complexityedge-coloring approachnetwork flowrouting problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Asymmetrical multiconnection three‐stage clos networks
• scientific article; zbMATH DE number 1535251
• Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
• The complexity of routing in Clos permutation networks
• A new routing algorithm for multirate rearrangeable Clos networks.

Cited in

(8)

• A new routing algorithm for multirate rearrangeable Clos networks.
• Optimization models for routing in switching networks of Clos type with many stages
• scientific article; zbMATH DE number 3982886 (Why is no real title available?)
• Applications of matching and edge‐coloring algorithms to routing in clos networks
• A new routing algorithm for a class of rearrangeable networks
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• Asymmetrical multiconnection three‐stage clos networks
• Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks

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 Q4540067)