On Floor-Plan of Plane Graphs
From MaRDI portal
Publication:4268862
DOI10.1137/S0097539796308874zbMath0935.05039WikidataQ29391691 ScholiaQ29391691MaRDI QIDQ4268862
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
On \(k\)-greedy routing algorithms ⋮ Planar polyline drawings via graph transformations ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Star Shaped Orthogonal Drawing ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Enumerating floorplans with walls ⋮ Optimal polygonal representation of planar graphs ⋮ Star-Shaped and L-Shaped Orthogonal Drawings ⋮ Unnamed Item ⋮ Computing cartograms with optimal complexity ⋮ Recent Developments in Floorplan Representations ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ A theory of L-shaped floor-plans
This page was built for publication: On Floor-Plan of Plane Graphs
