Complexity measures for mosaic drawings
From MaRDI portal
Publication:2980906
Recommendations
Cites work
- Computing cartograms with optimal complexity
- On Diagrams Representing Maps
- On rectilinear duals for vertex-weighted plane graphs
- Orderly Spanning Trees with Applications
- Pixel and voxel representations of graphs
- Rectangular duals of planar graphs
- Strongly-connected outerplanar graphs with proper touching triangle representations
This page was built for publication: Complexity measures for mosaic drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980906)