论文信息 - On Bounds for the k-Partitioning of Graphs

On Bounds for the k-Partitioning of Graphs

Let an edge cut partition the vertex set of a graph into k disjoint subsets A1, ..., Ak with ||Ai|-|Aj|| ≤ 1. We consider the problem of determining the minimal size of such a cut for a given graph. For this we introduce a new lower bound method which is based on the solution of an extremal set problem and present bounds for some graph classes based on Hamming graphs.

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

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

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

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

[4] A. Hoffman,et al. Lower bounds for the partitioning of graphs , 1973 .

[5] Fan Chung,et al. Spectral Graph Theory , 1996 .

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

[7] Robert Elsässer,et al. On k-partitioning of Hamming Graphs , 1999, Discret. Appl. Math..

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

[9] Bruce Hendrickson,et al. The Chaco user`s guide. Version 1.0 , 1993 .

[10] Martin G. Everett,et al. A Localized Algorithm for Optimizing Unstructured Mesh Partitions , 1995, Int. J. High Perform. Comput. Appl..

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

[12] Jean Roman,et al. SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs , 1996, HPCN Europe.

[13] Ralf Diekmann,et al. PARTY - A Software Library for Graph Partitioning , 1997 .

[14] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..