Algorithms for Graph Partitioning on the Planted Partition Model

@inproceedings{Condon1999AlgorithmsFG,
title={Algorithms for Graph Partitioning on the Planted Partition Model},
author={Anne Condon and Richard M. Karp},
booktitle={RANDOM-APPROX},
year={1999}
}

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 more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups. We present a simple, linear-time algorithm for the graph l-partition problem and we analyze it on a random “planted l-partition… CONTINUE READING