A note on parallel algorithms for optimal 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-01T01:46:37Z
dc.date.available	2014-03-01T01:46:37Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24966
dc.subject	Binary Tree	en
dc.subject	Parallel Algorithm	en
dc.title	A note on parallel algorithms for optimal h-v drawings of binary trees	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0925-7721(96)00018-1	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0925-7721(96)00018-1	en
heal.publicationDate	1998	en
heal.abstract	In this paper we present a method to obtain optimal h-v drawings in parallel. Basedon parallel tree contraction, our method computes optimal (with respect to a class ofcost functions of the enclosing rectangle) drawings in O(log2n) parallel time by using apolynomial number of EREW processors. The number of processors reduces substantiallywhen we study minimum area drawings. Our work places the	en
heal.journalName	Computational Geometry: Theory and Applications	en
dc.identifier.doi	10.1016/S0925-7721(96)00018-1	en