Width-Optimal Visibility Representations of Plane Graphs

DOI10.1007/978-3-540-77120-3_16zbMath1193.05114OpenAlexW2122592687MaRDI QIDQ5387754

Hsueh-I Lu, Chun-Cheng Lin, Hsu-Chun Yen, Jia-Hao Fan

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_16

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Visibility representations of four-connected plane graphs with near optimal heights ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Special graph representation and visualization of semantic networks ⋮ Compact visibility representation of 4-connected plane graphs ⋮ Visibility drawings of plane 3-trees with minimum area ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights

Cites Work

• Improved visibility representation of plane graphs
• Visibility representation of plane graphs via canonical ordering tree
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Constrained visibility representations of graphs
• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
• Algorithms and Data Structures
• Nearly Optimal Visibility Representations of Plane Graphs

This page was built for publication: Width-Optimal Visibility Representations of Plane Graphs