Layered cross product&mdashA technique to construct interconnection networks
From MaRDI portal
Publication:4347276
DOI<219::AID-NET5>3.0.CO;2-I 10.1002/(SICI)1097-0037(199707)29:4<219::AID-NET5>3.0.CO;2-IzbMath0882.90042OpenAlexW2087996826MaRDI QIDQ4347276
Publication date: 7 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199707)29:4<219::aid-net5>3.0.co;2-i
Related Items (6)
Rearrangeability of bit permutation networks ⋮ Extending the Hong-Kung model to memory hierarchies ⋮ A theory of decomposition into prime factors of layered interconnection networks ⋮ Optimal three-dimensional layout of interconnection networks ⋮ Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing ⋮ De Bruijn digraphs and affine transformations
This page was built for publication: Layered cross product&mdashA technique to construct interconnection networks