Construction of asymmetric connectors of depth two

DOI10.1016/j.jcta.2006.03.009zbMath1102.90007OpenAlexW2029298929MaRDI QIDQ855860

Rudolf Ahlswede, Harout Aydinian

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.009

zbMATH Keywords

connectorconcentratorconstruction of \((n,N)\)-communication networksrearrangeable network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05)

Related Items (2)

Interactive Communication, Diagnosis and Error Control in Networks ⋮ Multicast Routing and Design of Sparse Connectors

Cites Work

• On rearrangeable and non-blocking switching networks
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• Wide-Sense Nonblocking Networks
• Rearrangeable Networks with Limited Depth
• Constructions of sparse asymmetric connectors with number theoretic methods
• Optimal Rearrangeable Multistage Connecting Networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of asymmetric connectors of depth two