Necessary and sufficient conditions for rearrangeable Log(d) (N, m, p)

Abstract

We extend previous results on sufficient conditions for rearrangeable Log(2) (N, m, p) networks to Log(d) (N, m, p) networks. We show that the original argument using path-intersecting graphs cannot be extended to d > 2, and we give a new argument. Further, we show our sufficient conditions are also necessary.