Visibility representations of four-connected plane graphs with near optimal heights
DOI10.1016/J.COMGEO.2009.01.006zbMATH Open1200.05142OpenAlexW1987559104MaRDI QIDQ833713FDOQ833713
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
Publication date: 14 August 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.01.006
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Computing an st-numbering
- Graph Drawing
- Canonical ordering trees and their applications in graph drawing
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
- Width-Optimal Visibility Representations of Plane Graphs
- Graph Drawing
- Nearly Optimal Visibility Representations of Plane Graphs
- Improved visibility representation of plane graphs
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Nearly Optimal Visibility Representations of Plane Graphs
- STACS 2004
- Algorithms and Data Structures
- Optimal st-Orientations for Plane Triangulations
Recommendations
This page was built for publication: Visibility representations of four-connected plane graphs with near optimal heights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833713)
