On bounds for the k-partitioning of graphs

Authors:
S. L. Bezrukov;R. Elsässer;U.-P. Schroeder
Affiliations:
Department of Mathematics and Computer Science, University of Wisconsin - Superior, Superior, WI;Department of Mathematics and Computer Science, University of Paderborn, Paderborn, Germany;Department of Mathematics and Computer Science, University of Paderborn, Paderborn, Germany
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 5
Cited 2

Theoretical aspects of VLSI pin limitations

SIAM Journal on Computing
SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs

HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes

WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
On k-Partitioning the n-Cube

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Lower bounds for the partitioning of graphs

IBM Journal of Research and Development

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.