Multilevel Hypergraph Partitioning

  • George Karypis
Part of the Combinatorial Optimization book series (COOP, volume 14)

Abstract

Hypergraph partitioning is an important problem with extensive application to many areas, including VLSI design [Alpert and Kahng, 1995], efficient storage of large databases on disks [Shekhar and Liu, 1996], and data mining [Mobasher et al., 1996; Karypis et al., 1999b] . The problem is to partition the vertices of a hypergraph into k equal-size parts, such that the number of hyperedges connecting vertices in different parts is minimized.

Keywords

Balance Constraint Vertex Weight Refinement Algorithm Refinement Phase 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpert, C. J., Huang, J. H., and Kahng, A. B. (1997). Multilevel circuit partitioning. In Proc. of the 34th ACM/IEEE Design Automation Conference. Google Scholar
  2. Alpert, C. J. and Kahng, A. B. (1995). Recent directions in netlist partitioning. Integration, the VLSI Journal, 19(1–2): 1–81.MATHCrossRefGoogle Scholar
  3. Barnard, S. T. and Simon, H. D. (1993). A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. In Proceedings of the sixth SIAM conference on Parallel Processing for Scientific Computing, pages 711–718.Google Scholar
  4. Berge, C. (1976). Graphs and Hypergraphs. American Elsevier, New york.MATHGoogle Scholar
  5. Bui, T. and Jones, C. (1993). A heuristic for reducing fill in sparse matrix factorization. In 6th SIAM Conf. Parallel Processing for Scientific Computing, pages 445–452.Google Scholar
  6. Cong, J. and Lim, S. K. (1998). Multiway Partitioning with Pairwise Movement. In Intl. Conference on Computer Aided Design. Google Scholar
  7. Cong, J. and Smith, M. L. (1993). A parallel bottom-up clustering algorithm with applications to circuit partitioning in vlsi design. In Proc. ACM/IEEE Design Automation Conference, pages 755–760.Google Scholar
  8. Dutt, S. and Deng, W. (1996a). A probability-based approach to VLSI circuit partitioning. In Proceedings of the ACM/IEEE Design Automation Conference. Google Scholar
  9. Dutt, S. and Deng, W. (1996b). VLSI circuit partitioning by cluster-removal using iterative improvement techniques. In Proc. Physical Design Workshop. Google Scholar
  10. Fiduccia, C. M. and Mattheyses, R. M. (1982). A linear time heuristic for improving network partitions. In In Proc. 19th IEEE Design Automation Conference, pages 175–181.CrossRefGoogle Scholar
  11. Hauck, S. and Borriello, G. (1995). An evaluation of bipartitioning technique. In Proc. Chapel Hill Conference on Advanced Research in VLSI. Google Scholar
  12. Hendrickson, B. and Leland, R. (1993). A multilevel algorithm for partitioning graphs. Technical Report SAND93–1301, Sandia National Laboratories.Google Scholar
  13. Hendrickson, B. and Leland, R. (1994). The chaco user’s guide, version 2.0. Technical Report SAND94–2692, Sandia National Laboratories.Google Scholar
  14. Karypis, G. (1999). Multilevel algorithms for multi-constraint hypergraph partitioning. Technical Report TR 99–034, Department of Computer Science, University of Minnesota.Google Scholar
  15. Karypis, G., Aggarwal, R., Kumar, V., and Shekhar, S. (1999a). Multilevel hypergraph partitioning: Application in vlsi domain. IEEE Transactions on VLSI Systems, 20(1). A short version appears in the proceedings of DAC 1997.Google Scholar
  16. Karypis, G., Han, E., and Kumar, V. (1999b). Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8):68–75.CrossRefGoogle Scholar
  17. Karypis, G. and Kumar, V. (1995). Analysis of multilevel graph partitioning. In Proceedings of Supercomputing. Also available on WWW at URL http://www.cs.umn.edu/~karypis.Google Scholar
  18. Karypis, G. and Kumar, V. (1998a). hMETiS 1.5: A hypergraph partitioning package. Technical report, Department of Computer Science, University of Minnesota. Available on the WWW at URL http://www.cs.umn.edu/~metis. Google Scholar
  19. Karypis, G. and Kumar, V. (1998b). METiS 4.0: Unstructured graph partitioning and sparse matrix ordering system. Technical report, Department of Computer Science, University of Minnesota. Available on the WWW at URL http://www.cs.umn.edu/~metis. Google Scholar
  20. Karypis, G. and Kumar, V. (1998c). Multilevel algorithms for multi-constraint graph partitioning. In Proceedings of Supercomputing. Also available on WWW at URL http://www.cs.umn.edu/~karypis.Google Scholar
  21. Karypis, G. and Kumar, V. (1999a). A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1). Also available on WWW at URL http://www.cs.umn.edu/~karypis. A short version appears in Intl. Conf. on Parallel Processing 1995.Google Scholar
  22. Karypis, G. and Kumar, V. (1999b). Multilevel k-way hypergraph partitioning. In Proceedings of the Design and Automation Conference. Google Scholar
  23. Karypis, G. and Kumar, V. (2000). Multilevel k-way hypergraph partitioning. VLSI Design. Google Scholar
  24. Kernighan, B. W. and Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291–307.MATHGoogle Scholar
  25. Krishnamurthy, B. (May 1984). An improved min-cut algorithm for partitioning VLSI networks. IEEE Transactions on Computers, Vol. C-33.Google Scholar
  26. Lengauer, T. (1990). Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, NY.MATHGoogle Scholar
  27. Mobasher, B., Jain, N., Han, E., and Srivastava, J. (1996). Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96–050, Department of Computer Science, University of Minnesota, Minneapolis.Google Scholar
  28. Pothen, A., Simon, H. D., and Liou, K.-P. (1990). Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11(3):430–452.MathSciNetMATHCrossRefGoogle Scholar
  29. Sanchis, L. A. (1989). Multiple-way network partitioning. IEEE Transactions on Computers, pages 62–81.Google Scholar
  30. Schloegel, K., Karypis, G., and Kumar, V. (September 1999). A new algorithm for multi-objective graph partitioning. In Proceedings of Europar 1999. Google Scholar
  31. Shekhar, S. and Liu, D. R. (1996). Partitioning similarity graphs: A framework for declustering problmes. Information Systems Journal, 21(4).Google Scholar
  32. Simon, H. D. and Teng, S.-H. (1993). How good is recursive bisection? Technical Report RNR-93–012, NAS Systems Division, NASA, Moffet Field, CA.Google Scholar
  33. Walshaw, C., Cross, M., and Everett, M. G. (1997). Dynamic load-balancing for parallel adaptive unstructured meshes. Parallel Processing for Scientific Computing. Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • George Karypis
    • 1
  1. 1.Department of Computer ScienceUniversity of MinnesotaUSA

Personalised recommendations