RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY

DOI10.17654/DM028010075zbMath1499.68281arXiv2101.06912OpenAlexW3200465660MaRDI QIDQ5076161

Krishnendra Shekhawat, Vinod Kumar

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.06912

zbMATH Keywords

cartogramrectangular dualVLSI circuitarea-universalityrectangularly dualizable graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

A theory of L-shaped floor-plans

Cites Work

• Area-universal drawings of biconnected outerplane graphs
• On rectangular cartograms
• A theory of rectangular dual graphs
• Drawing planar 3-trees with given face areas
• Area-Universal and Constrained Rectangular Layouts
• Rectangular duals of planar graphs
• Existence theorems for floorplans
• Floorplans, planar graphs, and layouts
• Drawing planar graphs with prescribed face areas
• Orthogonal Drawings for Plane Graphs with Specified Face Areas
• Computing cartograms with optimal complexity

This page was built for publication: RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY