A transformation algorithm to construct a rectangular floorplan

Simple item page
dc.contributor.authorShekhawat, Krishnendra
dc.date.accessioned2023-08-10T09:06:19Z
dc.date.available2023-08-10T09:06:19Z
dc.date.issued2021-06
dc.description.abstractA 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 RFPen_US
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0304397521002310
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11280
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectVLSI circuiten_US
dc.subjectAlgorithmen_US
dc.subjectRectangular Floorplanen_US
dc.subjectTransformationen_US
dc.subjectSubgraphen_US
dc.titleA transformation algorithm to construct a rectangular floorplanen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Mathematics