An effective algorithm for multiway hypergraph partitioning

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 49, Issue 8, 2002, Pages 1079-1092

  Zhao, Zhizi ^a   Tao, Lixin ^b   Zhao, Yongchang ^c  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b PACE UNIVERSITY   (United States)

^c NONE   (Canada)

Author keywords

Hypergraph partitioning; Iterative improvement; Multiway circuit partitioning; VLSI design

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; PERTURBATION TECHNIQUES; VLSI CIRCUITS;

MULTIWAY HYPERGRAPH PARTITIONING;

ELECTRIC NETWORK ANALYSIS;

EID: 0036688501     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2002.801224     Document Type: Article

References (21)

1. Recent directions in netlist partitioning
2. Large scale circuit partitioning with loose/stable net removal and signal flow based clustering
3. Multiway partitioning with pairwise movement
4. Two novel multiway circuit partitioning algorithms using relaxed locking
5. VLSI circuit partitioning by cluster-removal using iterative improvement techniques
6. A linear-time heuristic for improving network partitions
7. On implementation choices for iterative improvement partitioning algorithms
8. An evaluation of bipartitioning techniques
9. Multilevel hypergraph partitioning: Applications in VLSI domain
10. An efficient heuristic procedure for partitioning graphs
11. An improved min-cut algorithm for partitioning VLSI networks
12. An efficient algorithm for VLSI network partitioning problem using a cost function with balancing factor
13. Multilevel cooperative search for the circuit/hypergraph partitioning problem
14. A proper model for the partitioning of electrical circuits
15. Multiple-way network partitioning
16. Partitioning similarity graphs: A framework for declustering problems
17. Efficient network flow based min-cut balanced partitioning
18. A general purpose, multiway partitioning algorithm