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 …

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 …

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 …

While the performance of classical (von Neumann) computers has grown tremendously,
there is always demand for more than the current technology can deliver. At any given …

In the paper, we describe a polynomial time algorithm that, for every input graph, either
outputs the minimum bisection of the graph or halts without output. More importantly, we …

Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy
construction scheme with an appropriate tie-breaking rule (MIN-MAX-GREEDY) produces …

We study graph partitioning problems on graphs with edge capacities and vertex weights.
The problems of b-balanced cuts and k-balanced partitions are unified into a new problem …

We present a few results and a larger number of questions concerning partitions of graphs
or hypergraphs, where the objective is to maximize or minimize several quantities …

Abstract Let G=(N, E) be an edge-weighted undirected graph. The graph partitioning
problem is the problem of partitioning the node set N into k disjoint subsets of specified sizes …