Sciweavers

73
Voted
DAC
1989
ACM
15 years 28 days 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 ...
Andrew B. Kahng