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
BETA

Citations

Publications citing this paper.

657 Citations

050100'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 657 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Topics in black box optimization

  • A. Juels
  • Ph.D. thesis, EECS Department, University of…
  • 1996
2 Excerpts

On the method of bounded differences

  • C. McDiarmid
  • London Society Lecture Note Series, Vol. 141…
  • 1989
1 Excerpt

Similar Papers

Loading similar papers…