Parallel h-v drawings of binary trees

DOI10.1007/3-540-58325-4_215MaRDI QIDQ4525739zbMATH OpenFDO

Authors Antonios Symvonis, Panagiotis T. Metaxas, Grammati Pantziou

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_215

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A note on parallel algorithms for optimal h-v drawings of binary trees
• Constructing Huffman Trees in Parallel
• Parallel implementation of tree skeletons
• Parallel algorithms for tree traversals
• scientific article; zbMATH DE number 2100400
• Grid Drawings of Binary Trees: An Experimental Study
• Parallel algorithms for tree accumulations
• Parallel algorithms for treewidth two
• Binary tree algebraic computation and parallel algorithms for simple graphs

Cited in

(2)

• A note on parallel algorithms for optimal h-v drawings of binary trees
• Drawing a tree on parallel lines

This page was built for publication: Parallel h-v drawings of binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525739)