A fast hypergraph min-cut algorithm for circuit partitioning (Q2734604)

Circuit partitioning is one of the central problems in VLSI system design. The primary objective of circuit partitioning is to minimize the number of interconnections between different components of the partitioned circuit. So the circuit partitioning problem is closely related to the minimum cut problem. Recently, two very fast algorithms for computing minimum cuts in graphs were reported [\textit{H. Nagamochi} and \textit{T. Ibaraki}, SIAM J. Discrete Math. 5, No. 1, 54-66 (1992; Zbl 0754.05062)]. However, it is known that a circuit netlist cannot be accurately modeled by a graph, but only by a hypergraph. In this paper, we present the fastest algorithm known today for computing a minimum cut in a hypergraph which is a non-trivial extension of the result in \textit{M. Stoer} and \textit{F. Wagner} [J. ACM 44, No. 4, 585-591 (1997; Zbl 0891.68071)]. Since the netlist of a circuit can be modeled naturally as a hypergraph, this opens the opportunity for finding very-high-quality solutions for the circuit partitioning problem. Unlike most minimum cut algorithms which rely on flow computations in a network, ours is a non-flow-based algorithm.