Multilevel Hypergraph Partitioning
2002-06-17
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Multilevel Hypergraph Partitioning
Authors
Published Date
2002-06-17
Publisher
Type
Report
Abstract
Hypergraph partitioning is an important problem with extensive application to many areas, including VLSI design, efficient storage of large databases on disks, and data mining. 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. In recent years, multilevel partitioning algorithms have become the standard approach for partitioning large and irregular hypergraphs as they provide high quality solutions, can scale to very large hypergraphs, and require relatively small amount of time. These algorithms were initially developed for partitioning large graphs derived from scientific computations, but their advantages were quickly recognized by the VLSI CAD community and a number of different multilevel algorithms have been developed. In this chapter we try to provide an overview of the multilevel paradigm and describe the various algorithms that it uses and why it works.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 02-025
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Karypis, George. (2002). Multilevel Hypergraph Partitioning. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215529.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.