Floorplanning by graph dualization: L-shaped modules

Algorithmica

Volumn 10, Issue 6, 1993, Pages 429-456

  Sun, Yachyang ^a   Sarrafzadeh, Majid ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Adjacency graph; Floorplanning; Graph dualization; L shaped dual; L shaped module

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGRATED CIRCUIT LAYOUT;

ADJACENCY GRAPH; FLOORPLANNING; GRAPH DUALIZATION; L SHAPED DUAL; L SHAPED MODULE;

GRAPH THEORY;

EID: 0027884215     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01891831     Document Type: Article

References (15)

1. A Linear Time Algorithm To Check for the Existence of a Rectangular Dual of a Planar Triangulated Graph
2. A Linear Algorithm To Find a Rectangular Dual of a Planar Triangulated Graph
3. On the Number of Cycles of Length K in a Maximal Planar Graph
4. Finding a Minimum Circuit in a Graph
5. Rectangular Dual of Planar Graphs
6. Rectangular Dualization and Rectangular Dissections
7. Algorithms for Floorplan Design via Rectangular Dualization
8. An Algorithm for Path Connections and Its Applications
9. Graphs in Floor-Plan Design
10. Placement, Assignment and Floorplanning
11. Floorplan Design of VLSI Circuits