Browsing Department of Mathematics by Subject "Shuffle-exchange network"

Now showing items 1-1 of 1

Rearrangeability of (2 log n N− 1)-stage networks employing a uniform connection pattern

Bashirov, Rza (Calcolo, Springer, 2001)

In this paper, we study the rearrangeablity of multistage networks. Although the necessity of (2 lgN −1)1 stages for rearrangeability of a shuffle-exchange network has been known, the sufficiency of (2 lgN −1) stages has ...