1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorLang, Wen_US
dc.date.accessioned2014-12-08T15:48:53Z-
dc.date.available2014-12-08T15:48:53Z-
dc.date.issued1998-07-16en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/11536/32503-
dc.description.abstractThe tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved with a data-parallel algorithm. It takes O(height x log width) time on width processors when proper communication links between processors are available, where height and width are the height and width of the tree, respectively. The layout calculated by the algorithm has the minimum width. (C) 1998 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectalgorithmsen_US
dc.subjectdata-parallel algorithmsen_US
dc.subjectEREWen_US
dc.subjectPRAMen_US
dc.subjecttree layouten_US
dc.titleA data-parallel algorithm for minimum-width tree layouten_US
dc.typeArticleen_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume67en_US
dc.citation.issue1en_US
dc.citation.spage21en_US
dc.citation.epage28en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000075279800004-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000075279800004.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...