Compressing cube-connected cycles and butterfly networks

DOI10.1002/(SICI)1097-0037(199808)32:1%3C47::AID-NET4%3E3.0.CO;2-JzbMATH Open1015.68006OpenAlexW2038418619MaRDI QIDQ4540063FDOQ4540063

Authors: Ralf Klasing, Reinhard Lüling, Burkhard Monien 

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199808)32:1%3C47::aid-net4%3E3.0.co;2-j

Recommendations

• scientific article; zbMATH DE number 1262802
• Optimal embeddings of butterfly-like graphs in the hypercube
• Optimal emulations by butterfly-like networks
• Embedding hypercubes and related networks into mesh-connected processor arrays
• scientific article; zbMATH DE number 140144

zbMATH Keywords

large butterfly networkslarge cube-connected cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Network design and communication in computer systems (68M10)

Cited In (4)

• Broadcasting in butterfly and deBruijn networks (extended abstract)
• Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
• Title not available (Why is that?)
• Weakly distance-regular digraphs.

This page was built for publication: Compressing cube-connected cycles and butterfly networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540063)