Abstract.
This paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound. We show that the bisection width of an n -input butterfly network is \(2(\sqrt{2}-1)n + o(n) \approx 0.82n\) without wraparound, and n with wraparound. The former result is surprising, since it contradicts the prior ``folklore'' belief that the bisection width is n . We also show that every set of k nodes has at least (k/(2 log k))(1-o(1)) neighbors in a butterfly without wraparound, and at least (k/log k)(1-o(1)) neighbors in a butterfly with wraparound, if k is \(o(\sqrt{n})\) and o(n) , respectively.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 30, 1997, and in final form July 30, 2001. Online publication November 23, 2001.
Rights and permissions
About this article
Cite this article
Bornstein, C., Litman, A., Maggs, B. et al. On the Bisection Width and Expansion of Butterfly Networks . Theory Comput. Systems 34, 491–518 (2001). https://doi.org/10.1007/s00224-001-1026-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-001-1026-2