Bisection width of transposition graphs
نویسندگان
چکیده
منابع مشابه
Bisection widths of transposition graphs
We prove lower and upper bounds on bisection widths of the transposition graphs. This class of graphs contains several frequently studied intercon-nection networks including star graphs and hypercubes. In particular, we prove that the bisection width of the complete transposition graph is of order (n:n!) which solves the open problem (R) 3.356 of the Leighton's book 10] and determine nearly exa...
متن کاملAlliances and Bisection Width for Planar Graphs
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polynomial time. We base this on a proof of an upper bound of n on the bisection width for 4-connected pl...
متن کاملBisection widths of transposition graphs and their applications
We prove lower and upper bounds on bisection widths of the 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 (n:n!) which solves the open problem (R) 3.356 of the Leighton's book 11] and determine nearly exac...
متن کاملNew Spectral Lower Bounds on the Bisection Width of Graphs
The communication overhead is a major bottleneck for the execution of a process graph on a parallel computer system. In the case of two processors, the minimization of the communication can be modeled by the graph bisection problem. The spectral lower bound of 2jV j 4 for the bisection width of a graph is well-known. The bisection width is equal to 2jV j 4 iff all vertices are incident to 2 2 c...
متن کاملBounds on the bisection width for random d -regular graphs
In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. We provide bounds for 5 ≤ d ≤ 12. We also give empirical values of the size of the bisection f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00009-2