Proving the Rearrangeability of Connecting Networks by Group Calculations

DOI10.1002/J.1538-7305.1975.TB02845.XMaRDI QIDQ4082688zbMATH OpenOpenAlexFDO

Authors Václav E. Beneš

Publication date 1975

Published in Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/j.1538-7305.1975.tb02845.x

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05)

Cited in

(5)

• A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
• The generalized folding-cube network
• A new policy to solve routing conflicts in shuffle-exchange networks
• scientific article; zbMATH DE number 1334210 (Why is no real title available?)
• Rearrangeability of bit permutation networks

This page was built for publication: Proving the Rearrangeability of Connecting Networks by Group Calculations

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