Floorplanning by graph dualization: \(L\)-shaped modules
type: Item
instance of: scholarly article
title: Floorplanning by graph dualization: \(L\)-shaped modules
zbMATH Open document ID: 0780.94019
DOI: 10.1007/BF01891831
author: Yachyang Sun
author: Majid Sarrafzadeh
published in: Algorithmica
publication date: 1994-01-06T00:00:00Z
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 482029
zbMATH Keywords: VLSI
zbMATH Keywords: floorplanning
zbMATH Keywords: adjacency graph
zbMATH Keywords: graph dualization
zbMATH Keywords: \(L\)-shaped modules
zbMATH Keywords: \(L\)-shaped dual
MaRDI profile type: Publication
cites work: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
cites work: A linear algorithm to find a rectangular dual of a planar triangulated graph
cites work: On the number of cycles of lengthk in a maximal planar graph
cites work: Finding a Minimum Circuit in a Graph
cites work: Rectangular duals of planar graphs
cites work: Rectangular dualization and rectangular dissections
cites work: Floorplan design of VLSI circuits
full work available at URL: https://doi.org/10.1007/bf01891831
OpenAlex ID: W3163653332
description: scientific article; zbMATH DE number 482029