完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chong, Ka | |
dc.date.accessioned | 2009-08-23T04:39:21Z | |
dc.date.accessioned | 2020-05-25T06:25:26Z | - |
dc.date.available | 2009-08-23T04:39:21Z | |
dc.date.available | 2020-05-25T06:25:26Z | - |
dc.date.issued | 2006-10-26 | |
dc.date.submitted | 1996-12-19 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2563 | - |
dc.description.abstract | This paper presents a parallel algorithm for finding the minimum spanning tree of a weithted undirected graph in O(log n log log n) time using n + m processors on the EREW PRAM. The best previous known results for this problem run in O(log 1.5n ) time using a linear number of EREW processors, or O[log n log log n] time using (n +m)m∈processors, where ∈>0 is a constant. | |
dc.description.sponsorship | 中山大學,高雄市 | |
dc.format.extent | 8p. | |
dc.format.extent | 721217 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 1996 ICS會議 | |
dc.subject.other | Parallel Algorithms | |
dc.title | Finding Minimum Spanning Trees on the EREW PRAM | |
分類: | 1996年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics001996000103.pdf | 704.31 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。