In this paper, the rearrangeability of (2s-1)-stage networks is proved. This result is used to prove that (2 lognNN-1)-stage nonsymme- tric networks employing uniform connection pattern, two passes through s-stage networks with the same kth and (s-k+1)st stages, and 2 lognN-1 circulations through single-stage networks are rearrangeable.
CITATION STYLE
Bashirov, R. (2000). On the rearrangeability of multistage networks employing uniform connection pattern. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1909, pp. 170–179). Springer Verlag. https://doi.org/10.1007/3-540-40888-6_16
Mendeley helps you to discover research relevant for your work.