Compact visibility representation of plane graphs
From MaRDI portal
Recommendations
- Visibility representation of plane graphs with simultaneous bound for both width and height
- Nearly Optimal Visibility Representations of Plane Graphs
- Compact visibility representation of 4-connected plane graphs
- Compact visibility representation of 4-connected plane graphs
- Nearly Optimal Visibility Representations of Plane Graphs
Cited in
(16)- Visibility representation of plane graphs via canonical ordering tree
- Constrained visibility representations of graphs
- Special graph representation and visualization of semantic networks
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- Compact visibility representation of 4-connected plane graphs
- Visibility representation of plane graphs with simultaneous bound for both width and height
- Compact visibility representation of 4-connected plane graphs
- Rectangular and visibility representations of infinite planar graphs
- Graph Drawing
- Compact visibility representation and straight-line grid embedding of plane graphs.
- Nearly Optimal Visibility Representations of Plane Graphs
- Nearly Optimal Visibility Representations of Plane Graphs
- A more compact visibility representation
- Visibility drawings of plane 3-trees with minimum area
- Improved visibility representation of plane graphs
- Base-object location problems for base-monotone regions
This page was built for publication: Compact visibility representation of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113679)