Parallel h-v drawings of binary trees

dc.contributor.author	Μεταξάς, Παναγιώτης Τάκης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Συμβώνης, Αντώνιος	el
dc.date.accessioned	2015-05-29T19:06:05Z
dc.date.issued	2015-05-29
dc.identifier.uri	http://hdl.handle.net/11400/11900
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/chapter/10.1007%2F3-540-58325-4_215	en
dc.subject	δυαδικά δέντρα
dc.subject	παράλληλα σχέδια
dc.subject	επεξεργαστές
dc.subject	αλγόριθμος
dc.subject	binary trees
dc.subject	Parallel h-v drawings
dc.subject	processors
dc.subject	algorithm
dc.title	Parallel h-v drawings of binary trees	en
heal.type	conferenceItem
heal.classification	Επιστήμες
heal.classification	Πληροφορική
heal.classification	Science
heal.classification	Computer science
heal.classificationURI	N/A-Επιστήμες
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	http://skos.um.es/unescothes/C03532
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.identifier.secondary	DOI: 10.1007/3-540-58325-4_215
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	1994-08-25
heal.bibliographicCitation	Metaxas, P., Pantziou, G. and Symvonis, A. (1994) Parallel h-v drawings of binary trees. Proceedings of the 5th International Symposium, ISAAC '94. 834, pp.487-495. Beijing, China: Springer Berlin Heidelberg	en
heal.abstract	In this paper we present a method to obtain optimal h-v and inclusion 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(log2 n) parallel time by using a polynomial number of EREW processors. The method can be extended to compute optimal inclusion layouts in the case where each leaf l of the tree is represented by rectangle l x×l y. Our method also yields an NC algorithm for the slicing floorplanning problem. Whether this problem was in NC was an open question [2].	en
heal.publisher	Springer Berlin Heidelberg	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 5th International Symposium, ISAAC '94	en
heal.conferenceItemType	full paper