Visibility representation of plane graphs via canonical ordering tree

DOI10.1016/j.ipl.2005.05.024zbMath1177.05079OpenAlexW1990037379MaRDI QIDQ1044700

Xin He, Huaming Zhang

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.024

zbMATH Keywords

graph algorithmsvisibility representation

Mathematics Subject Classification ID

Trees (05C05) 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 (5)

Good spanning trees in graph drawing ⋮ Compact visibility representation of 4-connected plane graphs ⋮ Width-Optimal Visibility Representations of Plane Graphs ⋮ Visibility drawings of plane 3-trees with minimum area ⋮ AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved visibility representation of plane graphs
• How to draw a planar graph on a grid
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Planar graphs and poset dimension
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• STACS 2004
• Algorithms and Data Structures

This page was built for publication: Visibility representation of plane graphs via canonical ordering tree