# Algorithms for Graph Partitioning on the Planted Partition Model

• Anne Condon
• Richard M. Karp
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1671)

## Abstract

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 analyze it on a random “planted l-partition” model. In this model, the n nodes of a graph are partitioned into l groups, each of size n/l; two nodes in the same group are connected by an edge with some probability p, and two nodes in different groups are connected by an edge with some probability r < p. We show that if pr > n  − − 1/2 + ε for some constant ε, then the algorithm finds the optimal partition with probability $$1 - \exp( -n^{\theta(\epsilon)})$$.

## Preview

Unable to display preview. Download preview PDF.

## References

1. 1.
Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proc. 27th Annual ACM Symp. on Theory of Computing, pp. 284–293 (1995)Google Scholar
2. 2.
Bui, T.: On bisecting random graphs, Report Number MIT/LCS/TR-287, Lab¬oratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA (1983)Google Scholar
3. 3.
Bui, T., Chaudhuri, S., Leighton, T., Sipser, M.: Graph bisection algorithms with good average case behavior. Combinatorial 7(2), 171–191 (1987)
4. 4.
Boppana, R.B.: Eigenvalues and graph bisection: an average-case analysis. In: Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pp. 280–285 (1987)Google Scholar
5. 5.
Dyer, M.E., Frieze, A.M.: Fast solution of some random NP-hard problems. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pp. 331–336 (1986)Google Scholar
6. 6.
Feller, W.: An introduction to probability theory and its applications, 3rd edn., vol. 1. John Wiley and Sons, New York (1968)
7. 7.
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the ACM IEEE Nineteenth Design Automation Conference, pp. 174–181 (1982)Google Scholar
8. 8.
Frieze, A., Kannan, R.: The regularity lemma and approximation schemes for dense problems. In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 12–20 (1996)Google Scholar
9. 9.
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237–267 (1976)
10. 10.
Jerrum, M., Sorkin, G.B.: Simulated Annealing for graph bisection. In: Proceedings of the S4th Annual IEEE Symposium on the Foundations of Computer Science, pp. 94–103 (1993)Google Scholar
11. 11.
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning. Operations Research 37(6), 865–892 (1989)
12. 12.
Juels, A.: Topics in Black Box Optimization, Ph.D. Thesis, EECS Dept., U. California at Berkeley (1996)Google Scholar
13. 13.
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell. Syst. Tech. J. 49, 291–307Google Scholar
14. 14.
Petrov, V.V.: Sums of independent random variables. Springer, New York (1975)Google Scholar

© Springer-Verlag Berlin Heidelberg 1999

## Authors and Affiliations

• Anne Condon
• 1
• Richard M. Karp
• 2
1. 1.Computer Sciences DepartmentUniversity of WisconsinMadisonUSA
2. 2.Department of Computer Science and EngineeringUniversity of WashingtonSeattleUSA