Linear decomposition algorithm for VLSI design applications
暂无分享,去创建一个
[1] Konrad Doll,et al. Analytical placement: a linear or a quadratic objective function? , 1991, 28th ACM/IEEE Design Automation Conference.
[2] D. Adolphson. Optimal linear-ordering. , 1973 .
[3] Kenneth M. Hall. An r-Dimensional Quadratic Placement Algorithm , 1970 .
[4] Konrad Doll,et al. Partitioning Very Large Circuits Using Analytical Placement Techniques , 1994, 31st Design Automation Conference.
[5] D. F. Wong,et al. Efficient network flow based min-cut balanced partitioning , 1994, ICCAD 1994.
[6] R. Tsay,et al. A unified approach to partitioning and placement (VLSI layout) , 1991 .
[7] Georg Sigl,et al. GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] 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.
[9] Chung-Kuan Cheng,et al. Linear placement algorithms and applications to VLSI design , 1987, Networks.
[10] Chung-Kuan Cheng,et al. Module Placement Based on Resistive Network Optimization , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[11] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[12] Dorothea Wagner,et al. Modeling Hypergraphs by Graphs with the Same Mincut Properties , 1993, Inf. Process. Lett..