Algorithms for floorplan design via rectangular dualization
暂无分享,去创建一个
[1] R. Prim. Shortest connection networks and some generalizations , 1957 .
[2] John Grason. An approach to computerized space planning using graph theory , 1971, DAC '71.
[3] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[4] Alon Itai,et al. Some Matching Problems for Bipartite Graphs , 1978, JACM.
[5] Ulrich Lauther,et al. A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.
[6] Shimon Even,et al. Graph Algorithms , 1979 .
[7] William R. Heller. Wirability of logic circuit packages in LSI and VLSI , 1979, COMPSAC.
[8] A graph-planarization algorithm and its application to random graphs , 1980, Graph Theory and Algorithms.
[9] Robert J. Fowler,et al. Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..
[10] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, DAC 1982.
[11] William R. Heller,et al. The Planar Package Planner for System Designers , 1982, DAC 1982.
[12] R. Otten. Automatic Floorplan Design , 1982, DAC 1982.
[13] Edwin Kinnen,et al. Rectangular duals of planar graphs , 1985, Networks.
[14] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.
[15] Sartaj Sahni,et al. Simulated Annealing and Combinatorial Optimization , 1986, DAC 1986.