Abstract
The min-cut bipartitioning problem is a fundamental partitioning problem and is NP-Complete. It is also NP-Hard to find good approximate solutions for this problem. In this paper, we present a new effective refinement algorithm based on multilevel paradigm for graph bipartitioning. The success of our algorithm relies on exploiting both new Tabu search strategy and boundary refinement policy. Our experimental evaluations on 18 different graphs show that our algorithm produces excellent solutions compared with those produced by MeTiS that is a state-of-the-art partitioner in the literature.
Chapter PDF
Similar content being viewed by others
8. References
Alpert, C.J., Kahng, A.B.: Recent Directions in Netlist Partitioning. Integration, the VLSI Journal, Vol. 19(1995)1–18
Zha, H., He, X., Ding, C, Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. Proc. ACM Conf Information and Knowledge Management (2001)
Hendrickson, B., Leland, R.: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations. SI AM Journal on Scientific Computing, Vol. 16 (1995) 452–469
Wanschoor, R., Aubanel, E.: Mesh Partitioning for Computational Grids. Proc. 2nd Annual Conf on Communication Networks and Services Research (2004)
Ding, C, Xiaofeng, H., Hongyuan, Z., Ming, G., Simon, H.: A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering. Proc. IEEE Conf Data Mining (2001) 107–114
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman New York (1979)
Bui, T., Leland, C: Finding Good Approximate Vertex and Edge Partitions Is NP-Hard. Information Processing Letters, Vol. 42 (1992) 153–159
Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal, Vol. 49 (1970) 291–307
Fiduccia, C, Mattheyses, R.: A Linear-Time Heuristics for Improving Network Partitions. Proc. 19th Design Automation Conf (1982) 175–181
Karypis, G., Kumar, V.: MeTiS 4.0: Unstructured Graphs partitioning and sparse matrix ordering system. Technical Report, Department of Computer Science, University of Minnesota (1998) Available on the WWW at URL http://www.cs.umn.edu/~metis
Karypis, G., Kumar, V.: A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, Vol. 20 (1999) 12.
Selvakkumaran, N., Karypis, G.: Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. IEEE Trans. Computer Aided Design, Vol. 25 (2006) 504–517
Saab, Y.G.: An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs. IEEE Trans. Computers, Vol. 53 (2004) 641–653
Glover, F., Manuel, L.: Tabu search: Modern heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications Oxford (1993) 70–150
Alpert, C.J.: The ISPD98 Circuit benchmark suite. Proc. Intel Symposium of Physical Design (1998) 80–85
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Leng, M., Yu, S., Chen, Y. (2006). An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning. In: Wang, K., Kovacs, G.L., Wozny, M., Fang, M. (eds) Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management. PROLAMAT 2006. IFIP International Federation for Information Processing, vol 207. Springer, Boston, MA . https://doi.org/10.1007/0-387-34403-9_41
Download citation
DOI: https://doi.org/10.1007/0-387-34403-9_41
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34402-7
Online ISBN: 978-0-387-34403-4
eBook Packages: Computer ScienceComputer Science (R0)