Hypergraph Partitioning Techniques
نویسندگان
چکیده
Graph and hypergraph partitioning are important problems with applications in several areas including parallel processing, VLSI design automation, physical mapping of chromosomes and data classification. The problem is to divide the vertices of a hypergraph into k similar–sized blocks such that a given cost function defined over the hypergraph is optimized. The intent of this paper is to expose our readers to the theoretical and implementation issues of hypergraph partitioning techniques.
منابع مشابه
k-way Hypergraph Partitioning via n-Level Recursive Bisection
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsening and refinement, we reduce the running time by up to two-orders of magnitude compared to a naive n-level algorithm that would be adequate for ordinary graph partitioning. The overall performance is even better than the wid...
متن کاملRatio Cut Hypergraph Partitioning Using Bdd Based Mboa Optimization Algorithm
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using bin...
متن کاملA Serial Multilevel Hypergraph Partitioning Algorithm
The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix vector multiplications as a kernel operation. In many cases it is advantageous to use hypergraphs as they, compared to graphs, have a more general structure and can be used to model more complex relationships between...
متن کاملUniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques
Graph partitioning plays a central role in machine learning, and the development of graph partitioning algorithms is still an active area of research. The immense demand for such algorithms arises due to the abundance of applications that involve pairwise interactions or similarities among entities. Recent studies in computer vision and databases systems have emphasized on the necessity of cons...
متن کاملUnimodular Hypergraph based clustering approaches for VLSI Circuit Partitioning
The reliability of Integrated circuits mainly depends on the VLSI Design Automation techniques. The main problem faced in these techniques is the Physical Design Implementation. The size and performance parameters of an integrated circuit mainly rely on the three main domains of Physical Design which are Placement, Partitioning, and Routing. In this paper, the problem domain is expressed in Uni...
متن کامل