Construction of asymmetric connectors of depth two
From MaRDI portal
Publication:855860
DOI10.1016/j.jcta.2006.03.009zbMath1102.90007MaRDI 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
90B18: Communication networks in operations research
05C20: Directed graphs (digraphs), tournaments
94A05: Communication theory
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