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

dc.contributor.author	Μεταξάς, Παναγιώτης Τάκης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Συμβώνης, Αντώνιος	el
dc.date.accessioned	2015-05-24T21:04:47Z
dc.date.available	2015-05-24T21:04:47Z
dc.date.issued	2015-05-25
dc.identifier.uri	http://hdl.handle.net/11400/11093
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://www.sciencedirect.com/science/article/pii/S0925772196000181	en
dc.subject	σχέδιο
dc.subject	παράλληλος αλγόριθμος
dc.subject	παράλληλη συρρίκνωση δέντρου
dc.subject	διάταξη δέντρο
dc.subject	h-v drawing
dc.subject	Parallel algorithm
dc.subject	Parallel tree contraction
dc.subject	Tree layout
dc.title	A note on parallel algorithms for optimal h-v drawings of binary trees	en
heal.type	journalArticle
heal.classification	Πληροφορική
heal.classification	Μαθηματικά
heal.classification	Computer science
heal.classification	Mathematics
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μαθηματικά
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://skos.um.es/unescothes/C02437
heal.identifier.secondary	DOI: 10.1016/S0925-7721(96)00018-1
heal.language	en
heal.access	campus
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	1998-02
heal.bibliographicCitation	Metaxas, P., Pantziou, G. and Symvonis, A. (1998) A note on parallel algorithms for optimal h-v drawings of binary trees. Computational Geometry. [Online] 9 (3). pp.145-158. Available from: http://www.sciencedirect.com [Accessed 24/05/2015]	en
heal.abstract	In this paper we present a method to obtain optimal h-v drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in O(log2n) parallel time by using a polynomial number of EREW processors. The number of processors reduces substantially when we study minimum area drawings. Our work places the problem of obtaining optimal size h-v drawings in NC, presenting the first algorithm with polylogarithmic time complexity.	en
heal.publisher	Elsevier	en
heal.journalName	Computational Geometry	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	true