Improved floor-planning of graphs via adjacency-preserving transformations
DOI10.1007/S10878-010-9324-8zbMATH Open1239.05183OpenAlexW2009182542MaRDI QIDQ411253FDOQ411253
Authors: Huaming Zhang, Sadish Sadasivam 
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9324-8
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Planar graphs and poset dimension
- On Floor-Plan of Plane Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Compact floor-planning via orderly spanning trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Floorplanning by graph dualization: \(L\)-shaped modules
- Rectangular duals of planar graphs
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- Simple and efficient floor-planning
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Planar polyline drawings via graph transformations
- Rectangular dualization and rectangular dissections
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- On Planar Polyline Drawings
- Graph Drawing
- A theory of rectangular dual graphs
Cited In (3)
This page was built for publication: Improved floor-planning of graphs via adjacency-preserving transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411253)
