Layered cross product&mdashA technique to construct interconnection networks

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<219::AID-NET5>3.0.CO;2-I" /><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

Ami Litman, Shimon Even

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

zbMATH Keywords

interconnection networksbutterfly networklayered graphslayered cross product

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18)

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