Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
From MaRDI portal
Publication:1928497
DOI10.1007/s10878-011-9402-6zbMath1261.90084OpenAlexW2006071406MaRDI QIDQ1928497
Yang Wang, Thanh-Nhan Nguyen, Hung Quang Ngo
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9402-6
Related Items (1)
Cites Work
- Unnamed Item
- Graph-theoretic properties in computational complexity
- Superconcentrators of depths 2 and 3; odd levels help (rarely)
- Communication in bounded depth circuits
- A new routing algorithm for multirate rearrangeable Clos networks.
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
- On Nonblocking Multirate Interconnection Networks
- Expander graphs and their applications
- An approximate König's theorem for edge-coloring weighted bipartite graphs
- Nonblocking Multirate Networks
- Three-Stage Generalized Connectors
- Generalized Connectors
- Nonblocking multirate distribution networks
- On Rearrangeability of Multirate Clos Networks
- Designing Least-Cost Nonblocking Broadband Networks
- Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Crosspoint complexity of sparse crossbar concentrators
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Multirate multicast switching networks
- Monotone routing in multirate rearrangeable Clos networks
This page was built for publication: Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
