The NP-hard graph bisection problem is to partition the nodes of an undirected graph into
two equal-sized groups so as to minimize the number of edges that cross the partition. The …

The NP‐hard graph bisection problem is to partition the nodes of an undirected graph into
two equal‐sized groups so as to minimize the number of edges that cross the partition. The …

We study the expected time complexity of two graph partitioning problems: the graph
coloring and the cut into equal parts. If k= o (√ n log n), we can test whether two vertices of a …

A complete partition of a graph G is a partition of its vertex set in which any two distinct
classes are connected by an edge. Let cp (G) denote the maximum number of classes in a …

A common problem in graph theory is that of dividing the vertices of a graph into two sets of
prescribed size while cutting a minimum number of edges. In this paper this problem is …

Given the success of greedy approaches for graph bi-partitioning, this paper proposes some
greedy algorithms for k-way graph partitioning. An implementation of these algorithms is …

A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size
n/2. The bisection cost is the number of edges connecting the two sets. The problem of …

Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l
and u are nonnegative integers. One wishes to partition G into connected components by …

Algorithms for Graph Partitioning: A Survey Page 1 Link oping Electronic Articles in Computer
and Information Science Vol. 3(1998): nr 10 Link oping University Electronic Press Link oping …

In this thesis, we use Integer Programming (IP) to develop exact algorithms for the following
graph partition problem with minimum size constraints: given a complete graph K n=(V, E) …