A theory of rectangular dual graphs

DOI10.1007/BF01840399zbMath0712.05053OpenAlexW2002951652MaRDI QIDQ923112

Sany M. Leinwand, Yen-Tai Lai

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840399

zbMATH Keywords

bipartite graphmatching problemplane graphfloorplanrectangular dual graphrectangular graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (12)

RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY ⋮ Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Incremental hive graph ⋮ An annotated review on graph drawing and its applications ⋮ Optimal polygonal representation of planar graphs ⋮ Transformations among rectangular partitions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Simple and efficient floor-planning ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Rectangular duals of planar graphs
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Some Matching Problems for Bipartite Graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: A theory of rectangular dual graphs