| dc.contributor.author | Shekhawat, Krishnendra | |
| dc.date.accessioned | 2023-08-10T09:06:19Z | |
| dc.date.available | 2023-08-10T09:06:19Z | |
| dc.date.issued | 2021-06 | |
| dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0304397521002310 | |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11280 | |
| dc.description.abstract | A rectangular floorplan (RFP) is a partition of a rectangle into rectangles such that no four of them meet at a point. Rectangular floorplans find their applications in VLSI circuits floorplanning and architectural floorplanning. Let represent the graph of a rectangular floorplan RFP and be a subgraph of , where n denotes the number of rectangles in RFP. It is well known that every subgraph of may not admit an RFP, i.e., does not have a hereditary property. Hence, in this paper, we first derive a necessary and sufficient condition for to admit a rectangular floorplan RFP. Further, if admits an RFP, we present a linear time transformation algorithm for deriving RFP from RFP | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | VLSI circuit | en_US |
| dc.subject | Algorithm | en_US |
| dc.subject | Rectangular Floorplan | en_US |
| dc.subject | Transformation | en_US |
| dc.subject | Subgraph | en_US |
| dc.title | A transformation algorithm to construct a rectangular floorplan | en_US |
| dc.type | Article | en_US |
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||