Proving the Rearrangeability of Connecting Networks by Group Calculations
From MaRDI portal
Publication:4082688
DOI10.1002/j.1538-7305.1975.tb02845.xzbMath0319.94016OpenAlexW2043178714MaRDI QIDQ4082688
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
Related Items
Rearrangeability of bit permutation networks ⋮ A new policy to solve routing conflicts in shuffle-exchange networks ⋮ The generalized folding-cube network ⋮ Unnamed Item ⋮ A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks