Compact floor-planning via orderly spanning trees
From MaRDI portal
Publication:4458889
DOI10.1016/S0196-6774(03)00057-9zbMath1073.68901MaRDI QIDQ4458889
Hsueh-I Lu, Hsu-Chun Yen, Chien-Chih Liao
Publication date: 14 March 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Related Items
On \(k\)-greedy routing algorithms, Orientation-Constrained Rectangular Layouts, Linear-time algorithms for hole-free rectilinear proportional contact graph representations, Rectilinear Duals Using Monotone Staircase Polygons, On rectangular cartograms, Constrained floorplans in 2D and 3D, Improved floor-planning of graphs via adjacency-preserving transformations, Optimal polygonal representation of planar graphs, Unnamed Item, Computing cartograms with optimal complexity, CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS, On rectilinear duals for vertex-weighted plane graphs, AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING, A theory of L-shaped floor-plans