標題: A data-parallel algorithm for minimum-width tree layout
作者: Lang, W
資訊工程學系
Department of Computer Science
關鍵字: algorithms;data-parallel algorithms;EREW;PRAM;tree layout
公開日期: 16-七月-1998
摘要: The 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.
URI: http://hdl.handle.net/11536/32503
ISSN: 0020-0190
期刊: INFORMATION PROCESSING LETTERS
Volume: 67
Issue: 1
起始頁: 21
結束頁: 28
顯示於類別:期刊論文


文件中的檔案:

  1. 000075279800004.pdf