The number of rearrangements for Clos networks -- new results

DOI10.1016/J.TCS.2020.01.018zbMath1435.68047OpenAlexW3001669870WikidataQ126329475 ScholiaQ126329475MaRDI QIDQ2304555

Satoru Ohta

Publication date: 12 March 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.01.018

zbMATH Keywords

algorithmgraph theoryswitching networkClos network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• On Nonblocking Switching Networks Composed of Digital Symmetrical Matrices
• A new concept-repackable networks
• Applications of matching and edge‐coloring algorithms to routing in clos networks
• Lower bounds for wide-sense nonblocking Clos network

This page was built for publication: The number of rearrangements for Clos networks -- new results