Compact floor-planning via orderly spanning trees
From MaRDI portal
Publication:4458889
DOI10.1016/S0196-6774(03)00057-9zbMATH Open1073.68901MaRDI QIDQ4458889FDOQ4458889
Authors: Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen 
Publication date: 14 March 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Recommendations
Cited In (25)
- On rectangular cartograms
- On rectilinear duals for vertex-weighted plane graphs
- Trees, slices, and wheels: On the floorplan area minimization problem
- Computing and Combinatorics
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Optimal polygonal representation of planar graphs
- On \(k\)-greedy routing algorithms
- Title not available (Why is that?)
- Improved floor-planning of graphs via adjacency-preserving transformations
- Simple and efficient floor-planning
- A graph theoretic approach for generating \(T\)-shaped floor plans
- Principles and preliminary results for force-directed floorplanning with malleable blocks
- Rectilinear Duals Using Monotone Staircase Polygons
- Floorplan design of VLSI circuits
- Constrained floorplans in 2D and 3D
- Graph drawing for floorplanning with flexible blocks
- Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach
- Construction of floorplans for plane graphs over polygonal boundaries
- Computing cartograms with optimal complexity
- Orientation-Constrained Rectangular Layouts
- An attractor-repeller approach to floorplanning
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- A theory of L-shaped floor-plans
- Title not available (Why is that?)
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)
