A New Approach to E ective Circuit Clustering
暂无分享,去创建一个
[1] A. J. Stone,et al. Logic partitioning , 1966, DAC.
[2] Chung-Kuan Cheng,et al. Module Placement Based on Resistive Network Optimization , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[3] Thang Nguyen Bui. Graph bisection algorithms , 1986 .
[4] Carl Sechen,et al. IMPROVED SIMULATED ANNEALING ALGORIHM FOR ROW-BASED PLACEMENT. , 1987 .
[5] Frank Thomson Leighton,et al. Graph bisection algorithms with good average case behavior , 1984, Comb..
[6] N. Linial,et al. On the cover time of random walks on graphs , 1989 .
[7] 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.
[8] Chung-Kuan Cheng,et al. A two-level two-way partitioning algorithm , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[9] Hans Jürgen Prömel,et al. Finding clusters in VLSI circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[10] Andrew B. Kahng,et al. Fast spectral methods for ratio cut partitioning and clustering , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[11] Jason Cong,et al. Random walks for circuit clustering , 1991, [1991] Proceedings Fourth Annual IEEE International ASIC Conference and Exhibit.
[12] M. Karonski. Collisions among Random Walks on a Graph , 1993 .