Algorithms for Floorplan Design Via Rectangular Dualization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 7, Issue 12, 1988, Pages 1278-1289

  Lai, Yen Tai ^a   Leinwand, Sany M ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

BIPARTITE GRAPHS; FLOORPLAN DESIGN;

INTEGRATED CIRCUITS;

EID: 0024176443     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.16806     Document Type: Article

References (25)

1. J. Bhasker and S. Sahni, “A linear algorithm to find a rectangular dual of a planar triangulated graph,” in Proc. 23rd Design Automation Conf, pp. 108–114, 1986.
2. G. Brebner and D. Buchanan, “On compiling structural descriptions to floorplans,” in Proc. Int. Conf. Computer-Aided Design, pp. 67, 1983.
3. M.A. Breuer, “Min-cut placement,” Design and Fault-Tolerant Computing, vol. 1, no. 4, pp. 343–362, 1977.
4. M. Burstein. “An approach to design automatic of custom LSI chip layout based on heuristic planarization and annular embedding,” in Proc. 17th Design Automation Conf, pp. 1056–1058, 1980.
5. T. Chiba, I. Nishioka. and I. Shirakawa, “An algorithm of maximal planarization of graphs,” in Proc. ISCAS Symp. pp. 649–652, 1979.
6. S. Even, Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
7. R.J. Fowler, M.S. Paterson, and S.L. Tanimoto. “Optimal packing and covering in the plane are NP-complete,” Inform. Processing Lett., vol. 12, no. 3, pp. 133–137, 1981.
8. J. Grason, “An approach to computerized space planning using graph theory,” in Proc. Design Automation Workshop, pp. 170–176, 1971.
9. W.R. Heller, “Wirability of logic packages in LSI and VLSI,” in Proc. 3rd COMPSAC, pp. 95–100, 1979.
10. W.R. Heller, G. Sorkin, and K. Maling, “The planar package planner for system designers,” in Proc. 19th Design Automation Conf, pp. 253–260, 1982.
11. J. Hopcroft and R.M. Karp, “An n2-1/2 algorithm for maximum matching in bipartite graphs,” S1AM J. Comp., pp. 225–231, 1975.
12. J. Hopcroft and R. Tarjan, “Efficient planarity testing,” J. Comput. Mach., vol. 21, no. 4, pp. 549–568, 1974.
13. A. Itai, M. Rodeh, and S.L. Tanimoto, “Some matching problems for bipartite graphs,” J. Ass. Comput. Mach., vol. 24, no. 24, pp. 517–525, 1978.
14. K. Kozminski and E. Kinnen, “Rectangular duals of planar graphs,” Networks, vol. 15, pp. 145–157, 1985.
15. Y.T. Lai and S.M. Leinwand, “A theory of rectangular dual graph,” Algorithmica, to be published.
16. Y.T. Lai. “Algorithms for floorplan design.” Ph.D. dissertation, Univ. of Illinois, Chicago, 1984.
17. U. Lauther, “A min-cut placement algorithm for general cell assemblies based on a graph representation,” in Proc. 16th Design Automation Conf., pp. 777–784, 1979.
18. K. Maling. S. Mueller, and W.R. Heller, “On finding most optimal rectangular package plans,” in Proc. 19th Design Automation Conf., pp. 663–670, 1982.
19. S. Nahar, S. Sahni, and E. Shragowitz, “Simulated annealing and combinatorial optimization,” in Proc. 23rd Design Automation Conf., pp. 293–299, 1986.
20. O. Ore, The Four-Color Problem. New York: Academic, 1967.
21. R. Otten, “Automatic floorplan design,” in Proc. 19th Design Automation Conf., pp. 261–267, 1982.
22. T. Ozawa and H. Takahashi, “A graph-planarization algorithm and its application to random graphs,” in Proc. Graph Theory & Algorithms, Senda, Japan, pp. 95–107, Oct. 1980.
23. L.M. Pereira, “Artificial intelligence techniques in automatic layout design,” in A.I. and Pattern Recognition in C.A.D, Latombe, Ed., Amsterdam, The Netherlands: North Holland, 1978, pp. 159–173.
24. R.C. Prim, “Shortest connection networks and some generalizations,” Bell System Tech. J., vol. 36, pp. 1389–1401, 1957.
25. M.V. Swany and N.K. Thulasiraman, Graphs, Networks, and Algorithms. New York: Wiley Interscience, 1981.