Drawing trees in a streaming model
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1693557 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- A better heuristic for orthogonal graph drawings
- A note on optimal area algorithms for upward drawings of binary trees
- Data streams: algorithms and applications.
- Drawing trees in a streaming model
- How to draw a planar graph on a grid
- Interactive orthogonal graph drawing
- On graph problems in a semi-streaming model
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- The minimum area of convex lattice \(n\)-gons
Cited in
(11)- Graph drawing in the cloud: privately visualizing relational data using small working storage
- Algorithms and bounds for L-drawings of directed graphs
- Drawing trees in a streaming model
- Graph Stories in Small Area
- Small Point-Sets Supporting Graph Stories
- Small point-sets supporting graph stories
- On the complexity of the storyplan problem
- On the complexity of the storyplan problem
- Offline drawing of dynamic trees: algorithmics and document integration
- Drawing trees and animating tree changes
- Graph stories in small area
This page was built for publication: Drawing trees in a streaming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436551)