Construction of asymmetric connectors of depth two
From MaRDI portal
Publication:855860
DOI10.1016/J.JCTA.2006.03.009zbMATH Open1102.90007OpenAlexW2029298929MaRDI QIDQ855860FDOQ855860
Authors: Harout Aydinian, Rudolf Ahlswede 
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
Recommendations
- Sparse Asymmetric Connectors in Communication Networks
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Constructions of sparse asymmetric connectors with number theoretic methods
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- Wide-Sense Nonblocking Networks
Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- Optimal Rearrangeable Multistage Connecting Networks
- On rearrangeable and non-blocking switching networks
- Wide-Sense Nonblocking Networks
- Rearrangeable Networks with Limited Depth
- Title not available (Why is that?)
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- Constructions of sparse asymmetric connectors with number theoretic methods
Cited In (6)
- Constructions of sparse asymmetric connectors with number theoretic methods
- Sparse Asymmetric Connectors in Communication Networks
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Multicast Routing and Design of Sparse Connectors
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- Interactive Communication, Diagnosis and Error Control in Networks
This page was built for publication: Construction of asymmetric connectors of depth two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855860)
