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

Abrahamson, 1989, A simple parallel tree contraction algorithm, J. Algorithms, 10, 287, 10.1016/0196-6774(89)90017-5 Brent, 1974, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Match., 21, 201, 10.1145/321812.321815 Chen, 1990, Parallel algorithms for slicing floorplan designs, 279 Crescenzi, 1992, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry: Theory and Applications, 2, 187, 10.1016/0925-7721(92)90021-J Di Battista, 1994, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications, 4, 235, 10.1016/0925-7721(94)00014-X Eades, 1993, Two tree drawing conventions, Internat. J. Comput. Geom. Appl., 3, 133, 10.1142/S0218195993000099 Eades, 1992, Minimum size h-v drawings, Vol. 36, 386 Garg, 1992, Area-efficient upward tree drawings, 359 Metaxas, 1994, Parallel h-v drawings of binary trees, 834, 487 Metaxas, 1994, Parallel h-v drawings of binary trees, 10.1007/3-540-58325-4_215 Stockmeyer, 1993, Optimal orientations of cells in slicing floorplan designs, Inform. and Control, 57, 91, 10.1016/S0019-9958(83)80038-2