𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The bisection width of grid graphs

✍ Scribed by C. H. Papadimitriou, M. Sideri


Book ID
112511932
Publisher
Springer
Year
1996
Tongue
English
Weight
752 KB
Volume
29
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Bisection width of transposition graphs
✍ Ladislav Stacho; Imrich Vrt'o πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 894 KB

We prove lower and upper bounds on bisection width of transposition graphs. This class of graphs contains several frequently studied interconnection networks including star graphs and hypercubes. In particular, we prove that the bisection width of the complete transposition graph is of order O(n.n!)

Bisections of graphs
✍ Lee, Choongbum; Loh, Po-Shen; Sudakov, Benny πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 458 KB
On the bisection width of the transposit
✍ Kalpakis, Konstantinos; Yesha, Yaacov πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 103 KB πŸ‘ 3 views

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 judicious bisections of graphs
✍ Xu, Baogang; Yu, Xingxing πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 536 KB
The bisection width and the isoperimetri
✍ M Cemil Azizoğlu; Γ–mer Eğecioğlu πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 229 KB

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