On Representation of Planar Graphs by Segments

DOI10.1007/978-3-540-68880-8_29zbMath1143.05316OpenAlexW1868755489MaRDI QIDQ3511438

Huaming Zhang, Sadish Sadasivam

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_29

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs

Cites Work

• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Output-sensitive reporting of disjoint paths
• A left-first search algorithm for planar graphs
• CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
• Graph Drawing
• Nearly Optimal Visibility Representations of Plane Graphs
• Convex drawings of planar graphs and the order dimension of 3-polytopes
• Unnamed Item
• Unnamed Item