A note on parallel algorithms for optimal h-v drawings of binary trees

DOI10.1016/S0925-7721(96)00018-1zbMath0894.68075OpenAlexW2073388777MaRDI QIDQ1384199

Grammati E. Pantziou, Panagiotis T. Metaxas, Antonios Symvonis

Publication date: 19 August 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00018-1

zbMATH Keywords

EREW processorsparallel tree contraction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Proximity drawings in polynomial area and volume ⋮ On the approximability of two tree drawing conventions

Cites Work

• Unnamed Item
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• TWO TREE DRAWING CONVENTIONS
• Optimal orientations of cells in slicing floorplan designs
• The Parallel Evaluation of General Arithmetic Expressions
• A simple parallel tree contraction algorithm

This page was built for publication: A note on parallel algorithms for optimal h-v drawings of binary trees