Construction of asymmetric connectors of depth two
From MaRDI portal
(Redirected from Publication:855860)
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
Cites work
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1142304 (Why is no real title available?)
- Constructions of sparse asymmetric connectors with number theoretic methods
- On rearrangeable and non-blocking switching networks
- Optimal Rearrangeable Multistage Connecting Networks
- Rearrangeable Networks with Limited Depth
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- Wide-Sense Nonblocking Networks
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)