Fast Hypergraph Partition

9 years 6 months ago
Fast Hypergraph Partition
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our approach is based on the intersection gruph G dual to the input hypergraph. Paths in G are used to construct purtiul bipartitions which can be completed optimally. The method is provably good and, in particular, obtains optimum results for “difficult” inputs, i.e., hypergraphs with smaller than expected minimum cutsize. Computational results for a wide range of inputs are also discussed.
Andrew B. Kahng
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1989
Where DAC
Authors Andrew B. Kahng
Comments (0)