Applications of matching and edge‐coloring algorithms to routing in clos networks

DOI10.1002/NET.3230240603zbMATH Open0822.90058OpenAlexW2027472000MaRDI QIDQ4313624FDOQ4313624

Authors: John D. Carpinelli, A. Yavuz Oruç 

Publication date: 27 November 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240603

Recommendations

• scientific article; zbMATH DE number 3982886
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• scientific article; zbMATH DE number 2079420
• scientific article; zbMATH DE number 1769311
• Improved Bounds on Nonblocking 3-Stage Clos Networks

zbMATH Keywords

matchingbipartite graphsedge- coloringrearrangeable Clos networkstelephone switching

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a Class of Rearrangeable Switching Networks Part I: Control Algorithm
• A fast parallel algorithm for routing in permutation networks

Cited In (5)

• Improved edge-coloring with three colors
• Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
• A new routing algorithm for multirate rearrangeable Clos networks.
• The number of rearrangements for Clos networks -- new results
• Title not available (Why is that?)

This page was built for publication: Applications of matching and edge‐coloring algorithms to routing in clos networks

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