Abstract
In this paper, we consider the problem of partitioning the set of vertices of a graph intok subsets of approximately the same cardinality in such a way that the number of edges whose endpoints are in different subsets is minimized. A greedy heuristic, called Procedure1, based on the independent growth of each subset by fronts is proposed for constructing a good-quality graph partition. In addition, we present a more sophisticated version of the greedy heuristic, called Procedure2, which periodically calls a routine to refine the partition being built. We show that the partitions generated by Procedure1 are competitive with those obtained by several constructive heuristics in the literature, e.g. spectral, geometric, as well as other greedy heuristics. Moreover, the partitions produced by Procedure2 are compared with those produced by a leading graph partitioning method in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Battiti R, Bertossi A (1998) Differential Greedy for the 0-1 equicut problem. In Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location. Princeton, NJ, pp 3–21
Battiti R, Bertossi A (1997) Greedy and prohibition-based heuristics for graph-partitioning. Dip. di Matematica, Univ. di Trento, Italy, Technical Report UTM 512
Battiti R, Bertossi A, Cappelleti A (1999) Multilevel Reactive Tabu Search for Graph Partitioning. Dip. di Matematica, Univ. Trento, Italy, Technical Report UTM 554
Bui T, Chaudhuri S, Leigthon F, Sipser M (1987) Graph bisection algorithms with good average case behavior. Combinatorica 7(2):122–125
Bui TN, Moon BR (1996) Genetic Algorithm and Graph Partitioning. IEEE Trans Comput 45:841–855
Ciarlet P, Lamour F (1994) On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint. Comput Sci Depart, UCLA, LA, Technical Report, pp 94–37
Dell&Amico M, Maffioli F (1996) A new tabu search approach to the 0-1 equicut problem. In Meta Heuristics 1995: The State of the Art, Kluwer Academic Publishers, pp 361–377
Farhat C (1988) A simple and efficient automatic FEM domain decomposer. Comput Struct 28:579–602
Fiduccia CM, Mattheyses RM (1982) A linear time heuristic for improving network partitions. In: Proceedings of the IEEE Design Automation Conference, Las Vegas, pp 175–181
Garey M, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-Completeness. San Francisco, CA, Freeman
Gilbert JR, Miller GL, Teng SH (1995) Geometric mesh partitioning: implementation and experiments. In: Proceedings of the 9th International Parallel Processing Symposium, 1995, Santa Barbara, California, USA, pp 418–427
Hendrickson B, Leland R (1995a) A multilevel algorithm for partitioning graphs. In: Proceedings of supercomputing '95, San Diego, California, USA, pp 626–657
Hendrickson B, Leland R (1995b) An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J Scientific Comput 16:452–469
Jain S, Swamy C, Balaji K (1998) Greedy algorithms for k-way graph partitioning. In: Proceeding of the 6th International Conference on Advanced Computing, Pune, India
Johnson DS, Aragon CR, Mcgeoch LA, Schevon C (1989) Optimization by simulated annealing: an experimental evaluation; Part-I, graph partitioning. Oper Res 37:865–892
Karypis G, Kumar V (1995a) A fast and high quality multilevel scheme for partitioning irregular graphs. Department of Computer Science, University of Minnesota, MN, Technical Report, pp 95–035
Karypis G, Kumar V (1995b) Multilevel k-way partitioning scheme for irregular graphs. Department of Computer Science, University of Minnesota , MN, Technical Report, pp 95–064
Kernighan B, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291–307
Simon HD, Teng SH (1995) How good is recursive bisection? SIAM J Scientific Comput 18:1436–1445
Soper A, Walshaw C, Cross M (2004) A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J Global Optimi 29:225–241
Walshaw C (2004) Multilevel refinement for combinatorial optimisation problems. Ann Oper Res 131:325–372
Walshaw C, Cross M (2000) Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM J Scientific Comput 22(1):66–80
Wang M, Lim SK, Cong J, Sarrafzadeh M (2000) Multi-way partitioning using bi-partition heuristics. In: Proceedings of the 2000 IEEE/ACM Asia South Pacific Design Automation Conference, Yokohama, Japan, pp 667–672
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zamprogno, R., Amaral, A.R.S. An efficient approach for large scale graph partitioning. J Comb Optim 13, 289–320 (2007). https://doi.org/10.1007/s10878-006-9026-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9026-4