A fast heuristic algorithm for hypergraph bisection

Presents an efficient heuristic algorithm for the min-cut bisection of hypergraphs. In this algorithm, first, a given hypergraph is transformed into a graph called the netgraph, and then a solution is found on this netgraph. Since a netgraph can explicitly represent the weight of nodes of a hypergrap, it is easy to partition a hypergraph into two hypergraphs with the same size. The computation time of the proposed method is O(m²), where m is the number of nodes of a given hypergraph. Simulation results show that the proposed method produces better solutions in a shorter time compared with existing, methods, and that the solution is always balanced with the size of the partitioned hypergraphs