完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chen, Hon-Chan | |
| dc.contributor.author | Wang, Yue-Li | |
| dc.date.accessioned | 2009-08-23T04:39:08Z | |
| dc.date.accessioned | 2020-05-25T06:24:35Z | - |
| dc.date.available | 2009-08-23T04:39:08Z | |
| dc.date.available | 2020-05-25T06:24:35Z | - |
| dc.date.issued | 2006-10-26 | |
| dc.date.submitted | 1996-12-19 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2552 | - |
| dc.description.abstract | Let g=(V , E) be a connected graph of n vertices and m edges. The problem of constructing a spanning tree is to find an acyclic ssubgraph of G with n-1 edges. In this paper, we propose an efficient parallel algorithm for solving this problem on trapezoid graphs. Our algorithm runs in O(log n) time with O(n/ log n) processors on the EREW PRAM mode | |
| dc.description.sponsorship | 中山大學,高雄市 | |
| dc.format.extent | 4p. | |
| dc.format.extent | 282450 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1996 ICS會議 | |
| dc.subject.other | Parallel Algorithms | |
| dc.title | An Efficient Parallel Algorithm for Constructing a Spanning Tree on Trapezoid Graphs | |
| 分類: | 1996年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001996000104.pdf | 275.83 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。