Drawing trees in a streaming model

DOI10.1016/j.ipl.2012.02.011zbMath1243.68223OpenAlexW2032682686MaRDI QIDQ436551

Marco Gaertler, Maurizio Patrignani, Walter Didimo, Giuseppe Di Battista, Carla Binucci, Pietro Palladino, Antonios Symvonis, Ulrik Brandes, Katharina A. Zweig

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-209262

zbMATH Keywords

online algorithmsdesign of algorithmsgraph algorithmsgraph drawingstreaminglarge graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ On the complexity of the storyplan problem ⋮ On the complexity of the storyplan problem ⋮ Small Point-Sets Supporting Graph Stories ⋮ Small point-sets supporting graph stories ⋮ Graph Stories in Small Area ⋮ Graph stories in small area ⋮ Hierarchical partial planarity ⋮ Planarity of streamed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimum area of convex lattice \(n\)-gons
• How to draw a planar graph on a grid
• A note on optimal area algorithms for upward drawings of binary trees
• A better heuristic for orthogonal graph drawings
• On graph problems in a semi-streaming model
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• Drawing Trees in a Streaming Model
• Interactive orthogonal graph drawing

This page was built for publication: Drawing trees in a streaming model