Pages that link to "Item:Q4458889"
From MaRDI portal
The following pages link to Compact floor-planning via orderly spanning trees (Q4458889):
Displayed 14 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations (Q378246) (← links)
- Improved floor-planning of graphs via adjacency-preserving transformations (Q411253) (← links)
- On rectangular cartograms (Q883236) (← links)
- Constrained floorplans in 2D and 3D (Q896113) (← links)
- On rectilinear duals for vertex-weighted plane graphs (Q1011760) (← links)
- A theory of L-shaped floor-plans (Q2110365) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Rectilinear Duals Using Monotone Staircase Polygons (Q2942384) (← links)
- Orientation-Constrained Rectangular Layouts (Q3183461) (← links)
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS (Q4675884) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
- Computing cartograms with optimal complexity (Q5891266) (← links)
- (Q6150926) (← links)