A data-parallel algorithm for minimum-width tree layout

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Lang, W	en_US
dc.date.accessioned	2014-12-08T15:48:53Z	-
dc.date.available	2014-12-08T15:48:53Z	-
dc.date.issued	1998-07-16	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://hdl.handle.net/11536/32503	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	algorithms	en_US
dc.subject	data-parallel algorithms	en_US
dc.subject	EREW	en_US
dc.subject	PRAM	en_US
dc.subject	tree layout	en_US
dc.title	A data-parallel algorithm for minimum-width tree layout	en_US
dc.type	Article	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	67	en_US
dc.citation.issue	1	en_US
dc.citation.spage	21	en_US
dc.citation.epage	28	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000075279800004	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。