摘要：Hypergraph partitioning is critical for dividing and conquering intractable problems in many complex systems, which is an NP-hard problem. In the paper, a novel hypergraph bipartitioning algorithm is proposed, which partitions the hypergraph by separating the intersection graph. The new approach completely eliminates the adverse effects of hyperedges with large cardinality on the performance of the vertex-oriented refinement algorithms, and enhances the hill-climbing ability of the move-based refinement algorithms. Our approach also simplifies the vertex designation. Experiments on the industrial testing benchmark datasets indicate that our approach achieves an average of 7% improvement in performance over FM family partitioning algorithms.
