On 3-stage Clos networks with different nonblocking requirements on two types of calls

DOI10.1007/s10878-005-1410-yzbMath1127.90016OpenAlexW2063095589MaRDI QIDQ2569163

Hung-Lin Fu, Frank K. Hwang

Publication date: 18 October 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-1410-y

zbMATH Keywords

3-stage Clos networksnonblocking networksrearrangeable networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Cites Work

• An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
• A solution to a colouring problem of P. Erdős
• The Hamiltonian property of consecutive-\(d\) digraphs
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• On Representatives of Subsets
• Generalized multi‐stage connection networks

This page was built for publication: On 3-stage Clos networks with different nonblocking requirements on two types of calls