Parallel h-v Drawings of Binary Trees

Metaxas, P; Pantziou, G; Symvonis, A

dc.contributor.author	Metaxas, P	en
dc.contributor.author	Pantziou, G	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:48:14Z
dc.date.available	2014-03-01T02:48:14Z
dc.date.issued	1994	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33659
dc.subject	Binary Tree	en
dc.subject	Cost Function	en
dc.title	Parallel h-v Drawings of Binary Trees	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-58325-4_215	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-58325-4_215	en
heal.publicationDate	1994	en
heal.abstract	In this paper we present a method to obtain optimal h-v and inclusion drawings inparallel. Based on parallel tree contraction, our method computes optimal (with respectto a class of cost functions of the enclosing rectangle) drawings in O(log2n) parallel timeby using a polynomial number of EREW processors. The number of processors reducessubstantially when we study minimum area drawings. The method	en
heal.journalName	International Symposium on Algorithms and Computation	en
dc.identifier.doi	10.1007/3-540-58325-4_215	en