The transposition network T n of order n! is the Cayley graph of the symmetric group S n with generators the set of all transpositions in S n . Finding the bisection width of the transposition network is an open question posed by F. T. Leighton. We resolve this question for n even, by showing that t
On the Bisection Width and Expansion of Butterfly Networks
β Scribed by C. F. Bornstein; A. Litman; B. M. Maggs; R. K. Sitaraman; T. Yatzkar
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 254 KB
- Volume
- 34
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that the bisection width, bw(A d ), of a d-dimensional array i=e Ki where e is the largest index for which ke is even (if it exists, e = 1 otherwise) and Ki = ki-1ki-2 β’ β’ β’ k1. We also show that the edge-isoperimetric number i(A d ) is given by i(A d ) = 1= k d =2 . Furthermore, a bisecti
## Abstract Let __G__ be a connected graph. A routing in __G__ is a set of fixed paths for all ordered pairs of vertices in __G__. The forwarding index of __G__ is the minimum of the largest number of paths specified by a routing passing through any vertex of __G__ taken over all routings in __G__.