A graph theoretic technique to speed up floorplan area optimization

Ting Chi Wang, D.F. Wong

Research output: Chapter in book/report/conference proceedingConference proceeding

9 Citations (Scopus)


The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.
Original languageEnglish
Title of host publication29th ACM/IEEE Design Automation Conference - Proceedings 1992
Number of pages7
ISBN (Print)0818628227, 9780897915168
Publication statusPublished - 12 Jun 1992
Event29th ACM/IEEE Design Automation Conference, DAC 1992 - Anaheim, United States
Duration: 8 Jun 199212 Jun 1992

Publication series

NameACM/IEEE Design Automation Conference - Proceedings
ISSN (Print)0738-100X


Conference29th ACM/IEEE Design Automation Conference, DAC 1992
Country/TerritoryUnited States
Internet address

User-Defined Keywords

  • Topology
  • Algorithm design and analysis
  • Testing
  • Design optimization
  • Shortest path problem
  • Polynomials

Cite this