An Effective Multi-level Algorithm for Bisecting Graph

  • Ming Leng
  • Songnian Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4093)


Clustering is an important approach to graph partitioning. In this process a graph model expressed as the pairwise similarities between all data objects is represented as a weighted graph adjacency matrix. The min-cut bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level algorithm for bisecting graph. The success of our algorithm relies on exploiting both Tabu search theory and the concept of the graph core. 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.


Tabu Search Boundary Vertex Neighboring Vertex Aspiration Criterion Multilevel Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: Proc. ACM Conf Information and Knowledge Management, pp. 25–32 (2001)Google Scholar
  2. 2.
    Ding, C., Xiaofeng, H., Hongyuan, Z., Ming, G., Simon, H.: A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering. In: Proc. IEEE Conf Data Mining, pp. 107–114 (2001)Google Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New York (1979)MATHGoogle Scholar
  4. 4.
    Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal 49, 291–307 (1970)CrossRefMATHGoogle Scholar
  5. 5.
    Fiduccia, C., Mattheyses, R.: A Linear-Time Heuristics for Improving Network Partitions. In: Proc. 19th Design Automation Conf., pp. 175–181 (1982)Google Scholar
  6. 6.
    Alpert, C.J., Kahng, A.B.: Recent Directions in Netlist Partitioning. Integration, the VLSI Journal 19, 1–81 (1995)CrossRefMATHGoogle Scholar
  7. 7.
    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
  8. 8.
    Selvakkumaran, N., Karypis, G.: Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. IEEE Trans. Computer Aided Design 25, 504–517 (2006)CrossRefGoogle Scholar
  9. 9.
    Saab, Y.G.: An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs. IEEE Trans. Computers 53, 641–653 (2004)CrossRefGoogle Scholar
  10. 10.
    Amine, A.B., Karypis, G.: Multilevel Algorithms for Partitioning Power-Law Graphs. Technical Report, Department of Computer Science, University of Minnesota (2005), available on the WWW at URL
  11. 11.
    Alpert, C.J.: The ISPD98 Circuit benchmark suite. In: Proc. Intel Symposium of Physical Design, pp. 80–85 (1998)Google Scholar
  12. 12.
    Glover, F., Manuel, L.: Tabu search: Modern heuristic Techniques for Combinatorial Problems, pp. 70–150. Blackwell Scientific Publications, Oxford (1993)Google Scholar
  13. 13.
    Seidman, S.B.: Network structure and minimum degree. Social Networks, 269–287 (1983)Google Scholar
  14. 14.
    Batagelj, V., Zavers̃nik, M.: An O(m) Algorithm for cores decomposition of networks. Journal of the ACM, 799–809 (2001)Google Scholar
  15. 15.
    Batagelj, V., Zavers̃nik, M.: Generalized cores. Journal of the ACM, 1–8 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ming Leng
    • 1
  • Songnian Yu
    • 1
  1. 1.School of Computer Engineering and ScienceShanghai UniversityShanghaiPR China

Personalised recommendations