An improved partitioning method using clustering refinement [VLSI design]
暂无分享,去创建一个
[1] Ulrich Lauther,et al. Congestion-driven placement using a new multi-partitioning heuristic , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[2] Jason Cong,et al. Multiway VLSI circuit partitioning based on dual net representation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[4] Hyunchul Shin,et al. A simple yet effective technique for partitioning , 1993, IEEE Trans. Very Large Scale Integr. Syst..
[5] Chung-Kuan Cheng,et al. Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[6] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Chung-Kuan Cheng,et al. An experimental evaluation of partitioning algorithms , 1991, [1991] Proceedings Fourth Annual IEEE International ASIC Conference and Exhibit.
[9] Chung-Kuan Cheng,et al. A gradient method on the initial partition of Fiduccia-Mattheyses algorithm , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[10] Laura A. Sanchis,et al. Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.
[11] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[12] Chingwei Yeh,et al. A general purpose multiple way partitioning algorithm , 1991, DAC '91.