Visibility representations of four-connected plane graphs with near optimal heights
From MaRDI portal
(Redirected from Publication:833713)
Recommendations
Cites work
- A unified approach to visibility representations of planar graphs
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Canonical ordering trees and their applications in graph drawing
- Compact visibility representation and straight-line grid embedding of plane graphs.
- Computing an st-numbering
- Graph Drawing
- Graph Drawing
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- Improved visibility representation of plane graphs
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
- Nearly Optimal Visibility Representations of Plane Graphs
- Nearly Optimal Visibility Representations of Plane Graphs
- Optimal st-Orientations for Plane Triangulations
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- STACS 2004
- Width-Optimal Visibility Representations of Plane Graphs
Cited in
(2)
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)