Sliceable Floorplanning by Graph Dualization

DOI10.1137/S0895480191266700zbMath0826.68099OpenAlexW1992909066MaRDI QIDQ4837653

Majid Sarrafzadeh, Gary K. H. Yeap

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

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Aspect ratio universal rectangular layouts ⋮ Morphing rectangular duals ⋮ Optimal polygonal representation of planar graphs ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ Unnamed Item ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ Drawing slicing graphs with face areas ⋮ On rectilinear duals for vertex-weighted plane graphs

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