Sliceable Floorplanning by Graph Dualization

DOI10.1137/S0895480191266700MaRDI QIDQ4837653zbMATH OpenOpenAlexFDO

Authors Gary K. H. Yeap, Majid Sarrafzadeh

Publication date 3 July 1995

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480191266700

zbMATH Keywords

VLSIgraph dualizationrectangular dual graph floorplanning

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Floorplanning by graph dualization: \(L\)-shaped modules
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• scientific article; zbMATH DE number 1559558

Cited in

(13)

• Octagonal drawings of plane graphs with prescribed face areas
• On rectilinear duals for vertex-weighted plane graphs
• Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure
• Floorplanning by graph dualization: \(L\)-shaped modules
• Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
• Morphing rectangular duals
• A transformation algorithm to construct a rectangular floorplan
• Uniqueness of rectangularly dualizable graphs
• Extending partial representations of rectangular duals with given contact orientations
• Aspect ratio universal rectangular layouts
• Drawing slicing graphs with face areas
• Aspect ratio universal rectangular layouts
• How good are slicing floorplans?

This page was built for publication: Sliceable Floorplanning by Graph Dualization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837653)