论文信息 - On k-partitioning of Hamming Graphs

On k-partitioning of Hamming Graphs

Abstract We consider the graphs Han defined as the Cartesian products of n complete graphs with a vertices each. Let an edge cut partition the vertex set of a graph into k subsets A1,…,Ak with ||Ai|−|Aj||⩽1. We consider the problem of determining the minimal size of such a cut for the graphs defined above and present bounds and asymptotic results for some specific values of k.

Robert Elsässer | Ulf-Peter Schroeder | Sergei L. Bezrukov

[1] Sergei L. Bezrukov,et al. On k-Partitioning the n-Cube , 1996, WG.

[2] Rudolf Ahlswede,et al. General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions , 1997, Eur. J. Comb..

[3] José D. P. Rolim,et al. Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes , 1995, WG.

[4] John H. Lindsey,et al. Assignment of Numbers to Vertices , 1964 .

[5] Branislav Rovan,et al. On Partitioning Grids into Equal Parts , 1997, Comput. Artif. Intell..

[6] Shing-Tung Yau,et al. A near optimal algorithm for edge separators (preliminary version) , 1994, STOC '94.

[7] Rudolf Ahlswede,et al. General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods , 1997, Eur. J. Comb..

[8] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .

[9] Eric J. Schwabe. Optimality of a VLSI Decomposition Scheme for the Debruijn Graph , 1993, Parallel Process. Lett..

[10] Reinhard Lüling,et al. Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem , 1996, Parallel Algorithms Appl..

[11] Robert Cypher. Theoretical Aspects of VLSI Pin Limitations , 1993, SIAM J. Comput..

[12] Gary L. Miller,et al. Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..