Compact floor-planning via orderly spanning trees
From MaRDI portal
Recommendations
Cited in
(28)- Simple and efficient floor-planning
- On rectilinear duals for vertex-weighted plane graphs
- Floorplan design of VLSI circuits
- An attractor-repeller approach to floorplanning
- A theory of L-shaped floor-plans
- On k-greedy routing algorithms
- Rectilinear duals using monotone staircase polygons
- scientific article; zbMATH DE number 2084290 (Why is no real title available?)
- Orientation-Constrained Rectangular Layouts
- Principles and preliminary results for force-directed floorplanning with malleable blocks
- Graph drawing for floorplanning with flexible blocks
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach
- Improved floor-planning of graphs via adjacency-preserving transformations
- An optimal algorithm for layered wheel floorplan designs
- Graph-based techniques to speed up floorplan area optimization
- Trees, slices, and wheels: On the floorplan area minimization problem
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Computing and Combinatorics
- Computing cartograms with optimal complexity
- Linear-time construction of floor plans for plane triangulations
- A graph theoretic approach for generating T-shaped floor plans
- Construction of floorplans for plane graphs over polygonal boundaries
- Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
- Existence and construction of a C-shaped module within a floorplan
- On rectangular cartograms
- Constrained floorplans in 2D and 3D
This page was built for publication: Compact floor-planning via orderly spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458889)
